%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET117+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:46:39 PM UTC 2026
% Result : Theorem 3.97s 1.50s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 28 ( 24 unt; 6 def)
% Number of atoms : 49 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 7 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 16 !; 1 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(f44,conjecture,
! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
=> member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_1_to_ordered_pairs_are_sets) ).
fof(f45,negated_conjecture,
~ ! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
=> member(X0,universal_class) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0] :
( ordered_pair(first(X0),second(X0)) = X0
& ~ member(X0,universal_class) ),
inference(ennf_transformation,[],[f45]) ).
fof(f103,plain,
( sK6 = ordered_pair(first(sK6),second(sK6))
& ~ member(sK6,universal_class) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X0,sK6)],[f60]) ).
fof(f115,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f116,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f117,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f191,plain,
sK6 = ordered_pair(first(sK6),second(sK6)),
inference(cnf_transformation,[],[f103]) ).
fof(f192,plain,
~ member(sK6,universal_class),
inference(cnf_transformation,[],[f103]) ).
fof(f193,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f117,f116,f116]) ).
fof(f230,plain,
sK6 = unordered_pair(unordered_pair(first(sK6),first(sK6)),unordered_pair(first(sK6),unordered_pair(second(sK6),second(sK6)))),
inference(definition_unfolding,[],[f191,f193]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f115]) ).
tcf(c_128,negated_conjecture,
~ member(sK6,universal_class),
inference(cnf_transformation,[],[f192]) ).
tcf(c_129,negated_conjecture,
unordered_pair(unordered_pair(first(sK6),first(sK6)),unordered_pair(first(sK6),unordered_pair(second(sK6),second(sK6)))) = sK6,
inference(cnf_transformation,[],[f230]) ).
tcf(c_1557,definition,
iPr_def_10 = first(sK6),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1558,definition,
iPr_def_11 = unordered_pair(iPr_def_10,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1559,definition,
iPr_def_12 = second(sK6),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_1560,definition,
iPr_def_13 = unordered_pair(iPr_def_12,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_1561,definition,
iPr_def_14 = unordered_pair(iPr_def_10,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_1562,definition,
iPr_def_15 = unordered_pair(iPr_def_11,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_1563,negated_conjecture,
iPr_def_15 = sK6,
inference(demodulation,[status(thm)],[c_129,c_1559,c_1560,c_1561,c_1557,c_1558,c_1562]) ).
tcf(c_1564,negated_conjecture,
~ member(sK6,universal_class),
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_2394,plain,
~ member(iPr_def_15,universal_class),
inference(light_normalisation,[status(thm)],[c_1564,c_1563]) ).
tcf(c_2400,plain,
member(iPr_def_15,universal_class),
inference(superposition,[status(thm)],[c_1562,c_60]) ).
tcf(c_2401,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2400,c_2394]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET117+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/0.42 % Computer : n011.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Thu Sep 24 09:54:27 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/0.48 Running first-order theorem proving
% 0.17/0.48 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.50
% 0.17/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.17/0.50
% 0.17/0.50 % Detected problem language: tptp
% 0.26/0.52 % Proving...
% 3.97/1.50 % SZS status Started for theBenchmark.p
% 3.97/1.50 % SZS status Theorem for theBenchmark.p
% 3.97/1.50
% 3.97/1.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.97/1.50
% 3.97/1.50 % ------ iProver source info
% 3.97/1.50
% 3.97/1.50 % git: date: 2026-07-19 20:42:38 +0200
% 3.97/1.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.97/1.50 % git: non_committed_changes: false
% 3.97/1.50
% 3.97/1.50 % ------ Parsing...
% 3.97/1.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.97/1.50
% 3.97/1.50 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 3.97/1.50
% 3.97/1.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.97/1.50
% 3.97/1.50 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.97/1.50 % ------ Proving...
% 3.97/1.50 % ------ Problem Properties
% 3.97/1.50
% 3.97/1.50 %
% 3.97/1.50 % clauses 82
% 3.97/1.50 % conjectures 2
% 3.97/1.50 % EPR 9
% 3.97/1.50 % Horn 74
% 3.97/1.50 % unary 22
% 3.97/1.50 % binary 39
% 3.97/1.50 % lits 164
% 3.97/1.50 % lits eq 21
% 3.97/1.50 % fd_pure 0
% 3.97/1.50 % fd_pseudo 0
% 3.97/1.50 % fd_cond 4
% 3.97/1.50 % fd_pseudo_cond 3
% 3.97/1.50 % AC symbols 0
% 3.97/1.50
% 3.97/1.50 % ------ Schedule dynamic 5 is on
% 3.97/1.50
% 3.97/1.50 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.97/1.50
% 3.97/1.50
% 3.97/1.50 % ------
% 3.97/1.50 % Current options:
% 3.97/1.50 % ------
% 3.97/1.50
% 3.97/1.50
% 3.97/1.50 %
% 3.97/1.50
% 3.97/1.50 % ------ Proving...
% 3.97/1.50 %
% 3.97/1.50
% 3.97/1.50 % SZS status Theorem for theBenchmark.p
% 3.97/1.50
% 3.97/1.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.97/1.50
% 3.97/1.50
%------------------------------------------------------------------------------