%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET847-2 : 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 : n016.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 2.10s 11.31s
% Output : CNFRefutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 45 ( 22 unt; 3 def)
% Number of atoms : 107 ( 14 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 65 ( 37 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 7 ( 5 usr; 4 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 81 ( 0 sgn 81 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,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/theBenchmark.p',cls_Set_ODiffI_0) ).
fof(f2,axiom,
! [X0,X1] : ~ c_in(X0,c_emptyset,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OemptyE_0) ).
fof(f3,axiom,
! [X0,X1] : c_lessequals(c_emptyset,X0,tc_set(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oempty__subsetI_0) ).
fof(f4,axiom,
! [X2,X0,X1] :
( c_lessequals(X0,X1,tc_set(X2))
| c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
fof(f5,axiom,
! [X2,X0,X1] :
( X1 = X0
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
fof(f6,plain,
! [X2,X0,X1] :
( X0 = X1
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).
fof(f8,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(f9,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(f10,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(f11,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(f12,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_60,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,[],[f1]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : ~ c_in(X0,c_emptyset,X1),
inference(cnf_transformation,[],[f2]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : c_lessequals(c_emptyset,X0,tc_set(X1)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,X1,tc_set(X2))
| c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X1 )
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] : c_lessequals(X0,X0,tc_set(X1)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,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,[],[f8]) ).
tcf(c_67,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,[],[f9]) ).
tcf(c_68,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,[],[f10]) ).
tcf(c_69,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,[],[f11]) ).
tcf(c_70,negated_conjecture,
! [X0: $i] : ~ c_in(X0,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f12]) ).
tcf(c_159,definition,
iPr_def_10 = c_Zorn_Omaxchain(v_S,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_160,definition,
iPr_def_11 = tc_set(t_a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_161,definition,
iPr_def_12 = tc_set(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_162,negated_conjecture,
! [X0: $i] : ~ c_in(X0,iPr_def_10,iPr_def_12),
inference(demodulation,[status(thm)],[c_70,c_160,c_161,c_159]) ).
tcf(c_396,plain,
! [X0: $i] : c_lessequals(iPr_def_10,X0,tc_set(iPr_def_12)),
inference(superposition,[status(thm)],[c_63,c_162]) ).
tcf(c_404,plain,
! [X0: $i,X1: $i] :
( ( X0 = c_emptyset )
| ~ c_lessequals(X0,c_emptyset,tc_set(X1)) ),
inference(superposition,[status(thm)],[c_62,c_64]) ).
tcf(c_437,plain,
! [X0: $i,X1: $i] :
( c_in(X0,c_Zorn_Ochain(X1,t_a),tc_set(tc_set(t_a)))
| ~ c_in(X0,c_Zorn_OTFin(X1,t_a),tc_set(iPr_def_11)) ),
inference(superposition,[status(thm)],[c_160,c_67]) ).
tcf(c_442,plain,
! [X0: $i,X1: $i] :
( c_in(X0,c_Zorn_Ochain(X1,t_a),iPr_def_12)
| ~ c_in(X0,c_Zorn_OTFin(X1,t_a),iPr_def_12) ),
inference(light_normalisation,[status(thm)],[c_437,c_160,c_161]) ).
tcf(c_460,plain,
c_emptyset = iPr_def_10,
inference(superposition,[status(thm)],[c_396,c_404]) ).
tcf(c_471,plain,
! [X0: $i,X1: $i] : ~ c_in(X0,iPr_def_10,X1),
inference(demodulation,[status(thm)],[c_61,c_460]) ).
tcf(c_518,plain,
! [X0: $i,X1: $i] :
( c_in(c_Union(X0,iPr_def_11),c_Zorn_OTFin(X1,t_a),tc_set(iPr_def_11))
| ~ c_lessequals(X0,c_Zorn_OTFin(X1,t_a),tc_set(tc_set(tc_set(t_a)))) ),
inference(superposition,[status(thm)],[c_160,c_66]) ).
tcf(c_524,plain,
! [X0: $i,X1: $i] :
( c_in(c_Union(X0,iPr_def_11),c_Zorn_OTFin(X1,t_a),iPr_def_12)
| ~ c_lessequals(X0,c_Zorn_OTFin(X1,t_a),tc_set(iPr_def_12)) ),
inference(light_normalisation,[status(thm)],[c_518,c_160,c_161]) ).
tcf(c_540,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_66,c_68]) ).
tcf(c_551,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_540,c_65]) ).
tcf(c_607,plain,
! [X0: $i,X1: $i] :
( c_in(c_Union(X0,iPr_def_11),c_Zorn_Ochain(X1,t_a),iPr_def_12)
| ~ c_lessequals(X0,c_Zorn_OTFin(X1,t_a),tc_set(iPr_def_12)) ),
inference(superposition,[status(thm)],[c_524,c_442]) ).
tcf(c_617,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_551,c_69]) ).
tcf(c_638,plain,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_minus(c_Zorn_Ochain(v_S,t_a),iPr_def_10,tc_set(tc_set(tc_set(t_a)))),tc_set(tc_set(t_a))),
inference(superposition,[status(thm)],[c_159,c_617]) ).
tcf(c_644,plain,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),iPr_def_11),c_minus(c_Zorn_Ochain(v_S,t_a),iPr_def_10,tc_set(iPr_def_12)),iPr_def_12),
inference(light_normalisation,[status(thm)],[c_638,c_160,c_161]) ).
tcf(c_648,plain,
( c_in(c_Union(c_Zorn_OTFin(v_S,t_a),iPr_def_11),iPr_def_10,iPr_def_12)
| ~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),iPr_def_11),c_Zorn_Ochain(v_S,t_a),iPr_def_12) ),
inference(superposition,[status(thm)],[c_60,c_644]) ).
tcf(c_649,plain,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),iPr_def_11),c_Zorn_Ochain(v_S,t_a),iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_648,c_471]) ).
tcf(c_667,plain,
~ c_lessequals(c_Zorn_OTFin(v_S,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(iPr_def_12)),
inference(superposition,[status(thm)],[c_607,c_649]) ).
tcf(c_668,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_667,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET847-2 : 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/10.39 % Computer : n016.cluster.edu
% 0.09/10.39 % Model : x86_64 x86_64
% 0.09/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.39 % Memory : 8046.5625MB
% 0.09/10.39 % OS : Linux 6.8.0-71-generic
% 0.09/10.39 % CPULimit : 300
% 0.09/10.39 % WCLimit : 300
% 0.09/10.39 % DateTime : Thu Sep 24 12:16:55 UTC 2026
% 0.09/10.39 % CPUTime :
% 0.09/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/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.15/10.44
% 0.15/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.44
% 0.15/10.44 % Detected problem language: tptp
% 0.15/10.45 % Proving...
% 2.10/11.31 % SZS status Started for theBenchmark.p
% 2.10/11.31 % SZS status Unsatisfiable for theBenchmark.p
% 2.10/11.31
% 2.10/11.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.10/11.31
% 2.10/11.31 % ------ iProver source info
% 2.10/11.31
% 2.10/11.31 % git: date: 2026-07-19 20:42:38 +0200
% 2.10/11.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.10/11.31 % git: non_committed_changes: false
% 2.10/11.31
% 2.10/11.31 % ------ Parsing...% successful
% 2.10/11.31
% 2.10/11.31
% 2.10/11.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.10/11.31
% 2.10/11.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.10/11.31
% 2.10/11.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.10/11.31
% 2.10/11.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.10/11.31 % ------ Proving...
% 2.10/11.31 % ------ Problem Properties
% 2.10/11.31
% 2.10/11.31 %
% 2.10/11.31 % clauses 14
% 2.10/11.31 % conjectures 1
% 2.10/11.31 % EPR 2
% 2.10/11.31 % Horn 12
% 2.10/11.31 % unary 7
% 2.10/11.31 % binary 5
% 2.10/11.31 % lits 23
% 2.10/11.31 % lits eq 6
% 2.10/11.31 % fd_pure 0
% 2.10/11.31 % fd_pseudo 0
% 2.10/11.31 % fd_cond 0
% 2.10/11.31 % fd_pseudo_cond 1
% 2.10/11.31 % AC symbols 0
% 2.10/11.31
% 2.10/11.31 % ------ Schedule dynamic 5 is on
% 2.10/11.31
% 2.10/11.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.10/11.31
% 2.10/11.31
% 2.10/11.31 % ------
% 2.10/11.31 % Current options:
% 2.10/11.31 % ------
% 2.10/11.31
% 2.10/11.31
% 2.10/11.31 %
% 2.10/11.31
% 2.10/11.31 % ------ Proving...
% 2.10/11.31 %
% 2.10/11.31
% 2.10/11.31 % SZS status Unsatisfiable for theBenchmark.p
% 2.10/11.31
% 2.10/11.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.10/11.31
% 2.10/11.31
%------------------------------------------------------------------------------