%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET843-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 : n007.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:45 PM UTC 2026
% Result : Unsatisfiable 3.36s 1.19s
% Output : CNFRefutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 39 ( 12 unt; 0 def)
% Number of atoms : 77 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 74 ( 36 ~; 38 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 65 ( 0 sgn 65 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
fof(f372,axiom,
! [X2,X0,X1] :
( ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_less(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetE_0) ).
fof(f374,axiom,
! [X2,X0,X1] :
( X0 = X1
| c_less(X0,X1,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetI_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(f1436,axiom,
! [X2,X0,X1] :
( c_lessequals(X0,c_Union(X1,X2),tc_set(X2))
| ~ c_in(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnion__upper_0) ).
fof(f1437,axiom,
! [X2,X0,X1] : c_lessequals(X0,c_Zorn_Osucc(X1,X0,X2),tc_set(tc_set(X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OAbrial__axiom1_0) ).
fof(f1438,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(f1439,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(f1440,axiom,
! [X2,X3,X0,X1] :
( c_lessequals(X3,X0,tc_set(tc_set(X2)))
| X0 != c_Zorn_Osucc(X1,X0,X2)
| ~ c_in(X3,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_Oeq__succ__upper_0) ).
fof(f1441,plain,
! [X2,X3,X0,X1] :
( c_lessequals(X3,X0,tc_set(tc_set(X2)))
| c_Zorn_Osucc(X1,X0,X2) != X0
| ~ c_in(X3,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
inference(reorient_equations,[],[f1440]) ).
fof(f1442,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f1443,negated_conjecture,
( v_m != c_Zorn_Osucc(v_S,v_m,t_a)
| v_m != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f1444,negated_conjecture,
( v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| v_m = c_Zorn_Osucc(v_S,v_m,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
tcf(c_1416,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1442]) ).
tcf(c_1417,negated_conjecture,
( ( c_Zorn_Osucc(v_S,v_m,t_a) != v_m )
| ( c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) != v_m ) ),
inference(cnf_transformation,[],[f1443]) ).
tcf(c_1418,negated_conjecture,
( ( c_Zorn_Osucc(v_S,v_m,t_a) = v_m )
| ( c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) = v_m ) ),
inference(cnf_transformation,[],[f1444]) ).
tcf(c_1419,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(X3,X1,tc_set(tc_set(X2)))
| ~ c_in(X3,c_Zorn_OTFin(X0,X2),tc_set(tc_set(X2)))
| ~ c_in(X1,c_Zorn_OTFin(X0,X2),tc_set(tc_set(X2)))
| ( c_Zorn_Osucc(X0,X1,X2) != X1 ) ),
inference(cnf_transformation,[],[f1441]) ).
tcf(c_1420,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,[],[f1439]) ).
tcf(c_1421,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,[],[f1438]) ).
tcf(c_1422,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,c_Union(X1,X2),tc_set(X2))
| ~ c_in(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f1436]) ).
tcf(c_1424,plain,
! [X0: $i,X1: $i,X2: $i] : c_lessequals(X0,c_Zorn_Osucc(X1,X0,X2),tc_set(tc_set(X2))),
inference(cnf_transformation,[],[f1437]) ).
tcf(c_1425,plain,
! [X0: $i,X1: $i] : c_lessequals(X0,X0,tc_set(X1)),
inference(cnf_transformation,[],[f383]) ).
tcf(c_1428,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_less(X0,X1,tc_set(X2))
| ( X0 = X1 )
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f374]) ).
tcf(c_1430,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ c_less(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f372]) ).
tcf(c_6292,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ c_in(X2,X0,tc_set(X1))
| ~ c_less(c_Union(X0,X1),X2,tc_set(X1)) ),
inference(superposition,[status(thm)],[c_1422,c_1430]) ).
tcf(c_6324,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_less(X1,c_Zorn_Osucc(X0,X1,X2),tc_set(tc_set(X2)))
| ( c_Zorn_Osucc(X0,X1,X2) = X1 ) ),
inference(superposition,[status(thm)],[c_1424,c_1428]) ).
tcf(c_6410,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( c_Zorn_Osucc(X0,c_Union(X1,tc_set(X2)),X2) = c_Union(X1,tc_set(X2)) )
| ~ c_in(c_Zorn_Osucc(X0,c_Union(X1,tc_set(X2)),X2),X1,tc_set(tc_set(X2))) ),
inference(superposition,[status(thm)],[c_6324,c_6292]) ).
tcf(c_6466,plain,
! [X0: $i] :
( ( c_Zorn_Osucc(v_S,v_m,t_a) = v_m )
| ( c_Zorn_Osucc(X0,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a) = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) )
| ~ c_in(c_Zorn_Osucc(X0,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_1418,c_6410]) ).
tcf(c_6577,plain,
( ( c_Zorn_Osucc(v_S,v_m,t_a) = v_m )
| ( c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a) = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) )
| ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_1421,c_6466]) ).
tcf(c_6578,plain,
( ( c_Zorn_Osucc(v_S,v_m,t_a) = v_m )
| ( c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a) = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6577,c_1416]) ).
tcf(c_6585,plain,
c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
inference(superposition,[status(thm)],[c_1418,c_6578]) ).
tcf(c_6593,plain,
c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) != v_m,
inference(backward_subsumption_resolution,[status(thm)],[c_1417,c_6585]) ).
tcf(c_6597,plain,
! [X0: $i] :
( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
| ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_6585,c_1419]) ).
tcf(c_6600,plain,
! [X0: $i] :
( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6597,c_1416]) ).
tcf(c_6609,plain,
! [X0: $i] :
( c_lessequals(c_Union(X0,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| ~ c_lessequals(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))) ),
inference(superposition,[status(thm)],[c_1420,c_6600]) ).
tcf(c_6646,plain,
c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(superposition,[status(thm)],[c_1425,c_6609]) ).
tcf(c_6673,plain,
( c_less(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| ( c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) = v_m ) ),
inference(superposition,[status(thm)],[c_6646,c_1428]) ).
tcf(c_6678,plain,
c_less(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(forward_subsumption_resolution,[status(thm)],[c_6673,c_6593]) ).
tcf(c_6686,plain,
~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(superposition,[status(thm)],[c_6678,c_6292]) ).
tcf(c_6687,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6686,c_1416]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET843-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.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 12:08:23 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.42 % Proving...
% 3.36/1.19 % SZS status Started for theBenchmark.p
% 3.36/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.36/1.19
% 3.36/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.36/1.19
% 3.36/1.19 % ------ iProver source info
% 3.36/1.19
% 3.36/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.36/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.36/1.19 % git: non_committed_changes: false
% 3.36/1.19
% 3.36/1.19 % ------ Parsing...% successful
% 3.36/1.19
% 3.36/1.19
% 3.36/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.36/1.19
% 3.36/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e sup_sim: 0 sf_s rm: 26 0s sf_e pe_s pe_e %
% 3.36/1.19
% 3.36/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.36/1.19
% 3.36/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.36/1.19 % ------ Proving...
% 3.36/1.19 % ------ Problem Properties
% 3.36/1.19
% 3.36/1.19 %
% 3.36/1.19 % clauses 36
% 3.36/1.19 % conjectures 3
% 3.36/1.19 % EPR 9
% 3.36/1.19 % Horn 32
% 3.36/1.19 % unary 15
% 3.36/1.19 % binary 15
% 3.36/1.19 % lits 64
% 3.36/1.19 % lits eq 15
% 3.36/1.19 % fd_pure 0
% 3.36/1.19 % fd_pseudo 0
% 3.36/1.19 % fd_cond 2
% 3.36/1.19 % fd_pseudo_cond 5
% 3.36/1.19 % AC symbols 0
% 3.36/1.19
% 3.36/1.19 % ------ Schedule dynamic 5 is on
% 3.36/1.19
% 3.36/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.36/1.19
% 3.36/1.19
% 3.36/1.19 % ------
% 3.36/1.19 % Current options:
% 3.36/1.19 % ------
% 3.36/1.19
% 3.36/1.19
% 3.36/1.19 %
% 3.36/1.19
% 3.36/1.19 % ------ Proving...
% 3.36/1.19 %
% 3.36/1.19
% 3.36/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.36/1.19
% 3.36/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.36/1.19
% 3.36/1.19
%------------------------------------------------------------------------------