%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET071+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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:23 PM UTC 2026
% Result : Theorem 3.04s 1.29s
% Output : CNFRefutation 3.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 13 unt; 1 def)
% Number of atoms : 111 ( 45 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 94 ( 38 ~; 31 |; 21 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 33 !; 6 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f41,axiom,
! [X0] :
( X0 != null_class
=> ? [X1] :
( disjoint(X1,X0)
& member(X1,X0)
& member(X1,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(f44,conjecture,
! [X0,X1] :
( ( ~ member(X1,universal_class)
& ~ member(X0,universal_class) )
=> unordered_pair(X0,X1) = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_unordered_pair) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( ( ~ member(X1,universal_class)
& ~ member(X0,universal_class) )
=> unordered_pair(X0,X1) = null_class ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f57,plain,
! [X0] :
( null_class = X0
| ? [X1] :
( disjoint(X1,X0)
& member(X1,X0)
& member(X1,universal_class) ) ),
inference(ennf_transformation,[],[f41]) ).
fof(f60,plain,
? [X0,X1] :
( ~ member(X1,universal_class)
& ~ member(X0,universal_class)
& unordered_pair(X0,X1) != null_class ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1] :
( ~ member(X1,universal_class)
& ~ member(X0,universal_class)
& unordered_pair(X0,X1) != null_class ),
inference(flattening,[],[f60]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( ~ member(X0,unordered_pair(X1,X2))
| ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) )
& ( ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( ~ member(X0,unordered_pair(X1,X2))
| ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) )
& ( ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f67]) ).
fof(f102,plain,
! [X0] :
( null_class = X0
| ( disjoint(sK4(X0),X0)
& member(sK4(X0),X0)
& member(sK4(X0),universal_class) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f57]) ).
fof(f104,plain,
( ~ member(sK7,universal_class)
& ~ member(sK6,universal_class)
& null_class != unordered_pair(sK6,sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f61]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f113,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| member(X0,universal_class) ),
inference(cnf_transformation,[],[f68]) ).
fof(f187,plain,
! [X0] :
( null_class = X0
| member(sK4(X0),X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f192,plain,
~ member(sK7,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f193,plain,
~ member(sK6,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f194,plain,
null_class != unordered_pair(sK6,sK7),
inference(cnf_transformation,[],[f104]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,universal_class)
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f113]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_124,plain,
! [X0: $i] :
( member(sK4(X0),X0)
| ( X0 = null_class ) ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_128,negated_conjecture,
unordered_pair(sK6,sK7) != null_class,
inference(cnf_transformation,[],[f194]) ).
tcf(c_129,negated_conjecture,
~ member(sK6,universal_class),
inference(cnf_transformation,[],[f193]) ).
tcf(c_130,negated_conjecture,
~ member(sK7,universal_class),
inference(cnf_transformation,[],[f192]) ).
tcf(c_1562,definition,
iPr_def_10 = unordered_pair(sK6,sK7),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1563,negated_conjecture,
~ member(sK7,universal_class),
inference(demodulation,[status(thm)],[c_130]) ).
tcf(c_1564,negated_conjecture,
~ member(sK6,universal_class),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_1565,negated_conjecture,
iPr_def_10 != null_class,
inference(demodulation,[status(thm)],[c_128,c_1562]) ).
tcf(c_2492,plain,
! [X0: $i] :
( member(X0,universal_class)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1562,c_58]) ).
tcf(c_2507,plain,
( member(sK4(iPr_def_10),universal_class)
| ( null_class = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_124,c_2492]) ).
tcf(c_3212,plain,
! [X0: $i,X1: $i] :
( ( unordered_pair(X0,X1) = null_class )
| ( sK4(unordered_pair(X0,X1)) = X1 )
| ( sK4(unordered_pair(X0,X1)) = X0 ) ),
inference(superposition,[status(thm)],[c_124,c_59]) ).
tcf(c_3451,plain,
( ( sK4(iPr_def_10) = sK6 )
| ( unordered_pair(sK6,sK7) = null_class )
| ( sK4(unordered_pair(sK6,sK7)) = sK7 ) ),
inference(superposition,[status(thm)],[c_1562,c_3212]) ).
tcf(c_3480,plain,
( ( null_class = iPr_def_10 )
| ( sK4(iPr_def_10) = sK7 )
| ( sK4(iPr_def_10) = sK6 ) ),
inference(light_normalisation,[status(thm)],[c_3451,c_1562]) ).
tcf(c_4094,plain,
( member(sK7,universal_class)
| ( null_class = iPr_def_10 )
| ( sK4(iPr_def_10) = sK6 ) ),
inference(superposition,[status(thm)],[c_3480,c_2507]) ).
tcf(c_4095,plain,
( ( null_class = iPr_def_10 )
| ( sK4(iPr_def_10) = sK6 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4094,c_1563]) ).
tcf(c_4464,plain,
( member(sK6,universal_class)
| ( null_class = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_4095,c_2507]) ).
tcf(c_4465,plain,
null_class = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_4464,c_1564]) ).
tcf(c_4492,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_1565,c_4465]) ).
tcf(c_4493,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_4492]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET071+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 09:30:31 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 3.04/1.29 % SZS status Started for theBenchmark.p
% 3.04/1.29 % SZS status Theorem for theBenchmark.p
% 3.04/1.29
% 3.04/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.04/1.29
% 3.04/1.29 % ------ iProver source info
% 3.04/1.29
% 3.04/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.04/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.04/1.29 % git: non_committed_changes: false
% 3.04/1.29
% 3.04/1.29 % ------ Parsing...
% 3.04/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.04/1.29
% 3.04/1.29 % ------ 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.04/1.29
% 3.04/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.04/1.29
% 3.04/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.04/1.29 % ------ Proving...
% 3.04/1.29 % ------ Problem Properties
% 3.04/1.29
% 3.04/1.29 %
% 3.04/1.29 % clauses 78
% 3.04/1.29 % conjectures 3
% 3.04/1.29 % EPR 10
% 3.04/1.29 % Horn 70
% 3.04/1.29 % unary 18
% 3.04/1.29 % binary 39
% 3.04/1.29 % lits 160
% 3.04/1.29 % lits eq 16
% 3.04/1.29 % fd_pure 0
% 3.04/1.29 % fd_pseudo 0
% 3.04/1.29 % fd_cond 4
% 3.04/1.29 % fd_pseudo_cond 3
% 3.04/1.29 % AC symbols 0
% 3.04/1.29
% 3.04/1.29 % ------ Schedule dynamic 5 is on
% 3.04/1.29
% 3.04/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.04/1.29
% 3.04/1.29
% 3.04/1.29 % ------
% 3.04/1.29 % Current options:
% 3.04/1.29 % ------
% 3.04/1.29
% 3.04/1.29
% 3.04/1.29 %
% 3.04/1.29
% 3.04/1.29 % ------ Proving...
% 3.04/1.29 %
% 3.04/1.29
% 3.04/1.29 % SZS status Theorem for theBenchmark.p
% 3.04/1.29
% 3.04/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.04/1.29
% 3.04/1.29
%------------------------------------------------------------------------------