%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET847-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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:48:46 PM UTC 2026
% Result : Unsatisfiable 4.32s 11.30s
% Output : CNFRefutation 4.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 45 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 22 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 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 : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 61 ( 0 sgn 61 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
fof(f206,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,c_minus(X1,X3,tc_set(X2)),X2)
| c_in(X0,X3,X2)
| ~ c_in(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_ODiffI_0) ).
fof(f383,axiom,
! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
fof(f1434,axiom,
! [X2,X0,X1] :
( c_in(c_Zorn_Osucc(X1,X0,X2),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin_OsuccI_0) ).
fof(f1435,axiom,
! [X2,X0,X1] :
( c_in(c_Union(X0,tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_lessequals(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(tc_set(X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).
fof(f1436,axiom,
! [X2,X0,X1] :
( c_in(X0,c_Zorn_Ochain(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__chain__lemma4_0) ).
fof(f1439,axiom,
! [X0,X1] :
( c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)) = c_Zorn_Osucc(X0,c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),X1)
| ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_OTFin(X0,X1),tc_set(tc_set(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Oequal__succ__Union_1) ).
fof(f1440,axiom,
! [X2,X0,X1] :
( c_Zorn_Osucc(X1,X0,X2) != X0
| ~ c_in(X0,c_minus(c_Zorn_Ochain(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(tc_set(X2)))),tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Osucc__not__equals_0) ).
fof(f1441,negated_conjecture,
! [X0] : ~ c_in(X0,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
tcf(c_1413,negated_conjecture,
! [X0: $i] : ~ c_in(X0,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1441]) ).
tcf(c_1414,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ c_in(X1,c_minus(c_Zorn_Ochain(X0,X2),c_Zorn_Omaxchain(X0,X2),tc_set(tc_set(tc_set(X2)))),tc_set(tc_set(X2)))
| ( c_Zorn_Osucc(X0,X1,X2) != X1 ) ),
inference(cnf_transformation,[],[f1440]) ).
tcf(c_1415,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,X3,X2)
| c_in(X0,c_minus(X1,X3,tc_set(X2)),X2)
| ~ c_in(X0,X1,X2) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_1420,plain,
! [X0: $i,X1: $i] :
( ( c_Zorn_Osucc(X0,c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),X1) = c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)) )
| ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_OTFin(X0,X1),tc_set(tc_set(X1))) ),
inference(cnf_transformation,[],[f1439]) ).
tcf(c_1422,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_in(c_Zorn_Osucc(X1,X0,X2),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
inference(cnf_transformation,[],[f1434]) ).
tcf(c_1423,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_in(X0,c_Zorn_Ochain(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
inference(cnf_transformation,[],[f1436]) ).
tcf(c_1439,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_in(c_Union(X0,tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_lessequals(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(tc_set(X2)))) ),
inference(cnf_transformation,[],[f1435]) ).
tcf(c_1443,plain,
! [X0: $i,X1: $i] : c_lessequals(X0,X0,tc_set(X1)),
inference(cnf_transformation,[],[f383]) ).
tcf(c_2938,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_in(c_Zorn_Osucc(X1,X0,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
inference(superposition,[status(thm)],[c_1422,c_1423]) ).
tcf(c_3347,plain,
! [X0: $i,X1: $i] :
( ( c_Zorn_Osucc(X0,c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),X1) = c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)) )
| ~ c_lessequals(c_Zorn_OTFin(X0,X1),c_Zorn_OTFin(X0,X1),tc_set(tc_set(tc_set(X1)))) ),
inference(superposition,[status(thm)],[c_1439,c_1420]) ).
tcf(c_3348,plain,
! [X0: $i,X1: $i] : c_Zorn_Osucc(X0,c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),X1) = c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),
inference(forward_subsumption_resolution,[status(thm)],[c_3347,c_1443]) ).
tcf(c_3350,plain,
! [X0: $i,X1: $i] :
( c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Ochain(X0,X1),tc_set(tc_set(X1)))
| ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_OTFin(X0,X1),tc_set(tc_set(X1))) ),
inference(superposition,[status(thm)],[c_3348,c_2938]) ).
tcf(c_3353,plain,
! [X0: $i,X1: $i] : ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_minus(c_Zorn_Ochain(X0,X1),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(tc_set(X1)))),tc_set(tc_set(X1))),
inference(superposition,[status(thm)],[c_3348,c_1414]) ).
tcf(c_3389,plain,
! [X0: $i,X1: $i] :
( c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_OTFin(X0,X1),tc_set(tc_set(X1)))
| ~ c_lessequals(c_Zorn_OTFin(X0,X1),c_Zorn_OTFin(X0,X1),tc_set(tc_set(tc_set(X1)))) ),
inference(instantiation,[status(thm)],[c_1439]) ).
tcf(c_3390,plain,
! [X0: $i,X1: $i] : c_lessequals(c_Zorn_OTFin(X0,X1),c_Zorn_OTFin(X0,X1),tc_set(tc_set(tc_set(X1)))),
inference(instantiation,[status(thm)],[c_1443]) ).
tcf(c_3485,plain,
! [X0: $i,X1: $i] :
( c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1)))
| ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Ochain(X0,X1),tc_set(tc_set(X1))) ),
inference(superposition,[status(thm)],[c_1415,c_3353]) ).
tcf(c_3629,plain,
! [X0: $i,X1: $i] : c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1))),
inference(global_subsumption_just,[status(thm)],[c_3485,c_3350,c_3389,c_3390,c_3485]) ).
tcf(c_3632,plain,
$false,
inference(superposition,[status(thm)],[c_3629,c_1413]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET847-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/10.38 % Computer : n006.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Thu Sep 24 12:12:02 UTC 2026
% 0.10/10.39 % CPUTime :
% 0.10/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/10.42 Running first-order theorem proving
% 0.14/10.43 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.14/10.44
% 0.14/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.44
% 0.14/10.44 % Detected problem language: tptp
% 0.14/10.45 % Proving...
% 4.32/11.30 % SZS status Started for theBenchmark.p
% 4.32/11.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.32/11.30
% 4.32/11.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.32/11.30
% 4.32/11.30 % ------ iProver source info
% 4.32/11.30
% 4.32/11.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.32/11.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.32/11.30 % git: non_committed_changes: false
% 4.32/11.30
% 4.32/11.30 % ------ Parsing...% successful
% 4.32/11.30
% 4.32/11.30
% 4.32/11.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.32/11.30
% 4.32/11.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 4.32/11.30
% 4.32/11.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.32/11.30
% 4.32/11.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.32/11.30 % ------ Proving...
% 4.32/11.30 % ------ Problem Properties
% 4.32/11.30
% 4.32/11.30 %
% 4.32/11.30 % clauses 40
% 4.32/11.30 % conjectures 1
% 4.32/11.30 % EPR 9
% 4.32/11.30 % Horn 36
% 4.32/11.30 % unary 14
% 4.32/11.30 % binary 19
% 4.32/11.30 % lits 73
% 4.32/11.30 % lits eq 14
% 4.32/11.30 % fd_pure 0
% 4.32/11.30 % fd_pseudo 0
% 4.32/11.30 % fd_cond 2
% 4.32/11.30 % fd_pseudo_cond 6
% 4.32/11.30 % AC symbols 0
% 4.32/11.30
% 4.32/11.30 % ------ Schedule dynamic 5 is on
% 4.32/11.30
% 4.32/11.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.32/11.30
% 4.32/11.30
% 4.32/11.30 % ------
% 4.32/11.30 % Current options:
% 4.32/11.30 % ------
% 4.32/11.30
% 4.32/11.30
% 4.32/11.30 %
% 4.32/11.30
% 4.32/11.30 % ------ Proving...
% 4.32/11.30 %
% 4.32/11.30
% 4.32/11.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.32/11.30
% 4.32/11.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.32/11.30
% 4.32/11.30
%------------------------------------------------------------------------------