%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET844-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 : n008.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 1.99s 6.31s
% Output : CNFRefutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 22 unt; 5 def)
% Number of atoms : 104 ( 12 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 42 ( 23 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 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 : 9 ( 7 usr; 6 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).
fof(f2,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(f3,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(f4,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,[],[f3]) ).
fof(f5,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(f6,negated_conjecture,
v_m = c_Zorn_Osucc(v_S,v_m,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f7,negated_conjecture,
~ c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : c_lessequals(X0,X0,tc_set(X1)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,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,[],[f2]) ).
tcf(c_57,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,[],[f4]) ).
tcf(c_58,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_59,negated_conjecture,
c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
inference(cnf_transformation,[],[f6]) ).
tcf(c_60,negated_conjecture,
~ c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_167,definition,
iPr_def_10 = c_Zorn_OTFin(v_S,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_168,definition,
iPr_def_11 = tc_set(t_a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_169,definition,
iPr_def_12 = c_Union(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_170,definition,
iPr_def_13 = tc_set(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_171,definition,
iPr_def_14 = c_Zorn_Osucc(v_S,v_m,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_172,negated_conjecture,
~ c_lessequals(iPr_def_12,v_m,iPr_def_13),
inference(demodulation,[status(thm)],[c_60,c_170,c_168,c_167,c_169]) ).
tcf(c_173,negated_conjecture,
iPr_def_14 = v_m,
inference(demodulation,[status(thm)],[c_59,c_171]) ).
tcf(c_174,negated_conjecture,
c_in(v_m,iPr_def_10,iPr_def_13),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_356,plain,
c_in(iPr_def_14,iPr_def_10,iPr_def_13),
inference(light_normalisation,[status(thm)],[c_174,c_173]) ).
tcf(c_357,plain,
~ c_lessequals(iPr_def_12,iPr_def_14,iPr_def_13),
inference(light_normalisation,[status(thm)],[c_172,c_173]) ).
tcf(c_362,plain,
c_Zorn_Osucc(v_S,iPr_def_14,t_a) = iPr_def_14,
inference(light_normalisation,[status(thm)],[c_171,c_173]) ).
tcf(c_367,plain,
! [X0: $i] :
( c_in(c_Union(X0,tc_set(t_a)),iPr_def_10,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_167,c_56]) ).
tcf(c_376,plain,
! [X0: $i] :
( c_in(c_Union(X0,iPr_def_11),iPr_def_10,iPr_def_13)
| ~ c_lessequals(X0,iPr_def_10,tc_set(iPr_def_13)) ),
inference(light_normalisation,[status(thm)],[c_367,c_167,c_168,c_170]) ).
tcf(c_390,plain,
! [X0: $i] :
( c_lessequals(X0,iPr_def_14,tc_set(tc_set(t_a)))
| ~ c_in(iPr_def_14,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_362,c_57]) ).
tcf(c_391,plain,
! [X0: $i] :
( c_lessequals(X0,iPr_def_14,iPr_def_13)
| ~ c_in(iPr_def_14,iPr_def_10,iPr_def_13)
| ~ c_in(X0,iPr_def_10,iPr_def_13) ),
inference(light_normalisation,[status(thm)],[c_390,c_167,c_168,c_170]) ).
tcf(c_392,plain,
! [X0: $i] :
( c_lessequals(X0,iPr_def_14,iPr_def_13)
| ~ c_in(X0,iPr_def_10,iPr_def_13) ),
inference(forward_subsumption_resolution,[status(thm)],[c_391,c_356]) ).
tcf(c_405,plain,
( c_in(iPr_def_12,iPr_def_10,iPr_def_13)
| ~ c_lessequals(iPr_def_10,iPr_def_10,tc_set(iPr_def_13)) ),
inference(superposition,[status(thm)],[c_169,c_376]) ).
tcf(c_407,plain,
c_in(iPr_def_12,iPr_def_10,iPr_def_13),
inference(forward_subsumption_resolution,[status(thm)],[c_405,c_55]) ).
tcf(c_411,plain,
c_lessequals(iPr_def_12,iPr_def_14,iPr_def_13),
inference(superposition,[status(thm)],[c_407,c_392]) ).
tcf(c_412,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_411,c_357]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET844-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.39 % Computer : n008.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Thu Sep 24 12:11:50 UTC 2026
% 0.11/5.40 % CPUTime :
% 0.11/5.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.44 Running first-order theorem proving
% 0.16/5.44 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.16/5.45
% 0.16/5.45 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.45
% 0.16/5.45 % Detected problem language: tptp
% 0.16/5.46 % Proving...
% 1.99/6.31 % SZS status Started for theBenchmark.p
% 1.99/6.31 % SZS status Unsatisfiable for theBenchmark.p
% 1.99/6.31
% 1.99/6.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.99/6.31
% 1.99/6.31 % ------ iProver source info
% 1.99/6.31
% 1.99/6.31 % git: date: 2026-07-19 20:42:38 +0200
% 1.99/6.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.99/6.31 % git: non_committed_changes: false
% 1.99/6.31
% 1.99/6.31 % ------ Parsing...% successful
% 1.99/6.31
% 1.99/6.31
% 1.99/6.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.99/6.31
% 1.99/6.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.99/6.31
% 1.99/6.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.99/6.31
% 1.99/6.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.99/6.31 % ------ Proving...
% 1.99/6.31 % ------ Problem Properties
% 1.99/6.31
% 1.99/6.31 %
% 1.99/6.31 % clauses 11
% 1.99/6.31 % conjectures 3
% 1.99/6.31 % EPR 3
% 1.99/6.31 % Horn 11
% 1.99/6.31 % unary 9
% 1.99/6.31 % binary 1
% 1.99/6.31 % lits 15
% 1.99/6.31 % lits eq 7
% 1.99/6.31 % fd_pure 0
% 1.99/6.31 % fd_pseudo 0
% 1.99/6.31 % fd_cond 0
% 1.99/6.31 % fd_pseudo_cond 0
% 1.99/6.31 % AC symbols 0
% 1.99/6.31
% 1.99/6.31 % ------ Schedule dynamic 5 is on
% 1.99/6.31
% 1.99/6.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.99/6.31
% 1.99/6.31
% 1.99/6.31 % ------
% 1.99/6.31 % Current options:
% 1.99/6.31 % ------
% 1.99/6.31
% 1.99/6.31
% 1.99/6.31 %
% 1.99/6.31
% 1.99/6.31 % ------ Proving...
% 1.99/6.31 %
% 1.99/6.31
% 1.99/6.31 % SZS status Unsatisfiable for theBenchmark.p
% 1.99/6.31
% 1.99/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.99/6.31
% 1.99/6.31
%------------------------------------------------------------------------------