%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET845-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 : n005.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.54s 1.16s
% Output : CNFRefutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 24 unt; 5 def)
% Number of atoms : 112 ( 19 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 42 ( 23 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 9 ( 7 usr; 6 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,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(f2,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(f3,plain,
! [X2,X0,X1] :
( X0 = X1
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(reorient_equations,[],[f2]) ).
fof(f4,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(f5,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(f6,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(f7,negated_conjecture,
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(f8,negated_conjecture,
v_m != c_Zorn_Osucc(v_S,v_m,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
tcf(c_56,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,[],[f1]) ).
tcf(c_57,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,[],[f3]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] : c_lessequals(X0,c_Zorn_Osucc(X1,X0,X2),tc_set(tc_set(X2))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_59,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,[],[f5]) ).
tcf(c_60,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f6]) ).
tcf(c_61,negated_conjecture,
c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) = v_m,
inference(cnf_transformation,[],[f7]) ).
tcf(c_62,negated_conjecture,
c_Zorn_Osucc(v_S,v_m,t_a) != v_m,
inference(cnf_transformation,[],[f8]) ).
tcf(c_110,definition,
iPr_def_10 = c_Zorn_Osucc(v_S,v_m,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_111,definition,
iPr_def_11 = c_Zorn_OTFin(v_S,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_112,definition,
iPr_def_12 = tc_set(t_a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_113,definition,
iPr_def_13 = c_Union(iPr_def_11,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_114,definition,
iPr_def_14 = tc_set(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_115,negated_conjecture,
iPr_def_10 != v_m,
inference(demodulation,[status(thm)],[c_62,c_110]) ).
tcf(c_116,negated_conjecture,
iPr_def_13 = v_m,
inference(demodulation,[status(thm)],[c_61,c_112,c_111,c_113]) ).
tcf(c_117,negated_conjecture,
c_in(v_m,iPr_def_11,iPr_def_14),
inference(demodulation,[status(thm)],[c_60,c_114]) ).
tcf(c_299,plain,
c_in(iPr_def_13,iPr_def_11,iPr_def_14),
inference(light_normalisation,[status(thm)],[c_117,c_116]) ).
tcf(c_300,plain,
iPr_def_10 != iPr_def_13,
inference(light_normalisation,[status(thm)],[c_115,c_116]) ).
tcf(c_301,plain,
c_Zorn_Osucc(v_S,iPr_def_13,t_a) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_110,c_116]) ).
tcf(c_304,plain,
! [X0: $i] :
( c_lessequals(X0,iPr_def_13,tc_set(iPr_def_12))
| ~ c_in(X0,iPr_def_11,tc_set(iPr_def_12)) ),
inference(superposition,[status(thm)],[c_113,c_56]) ).
tcf(c_307,plain,
! [X0: $i] :
( c_lessequals(X0,iPr_def_13,iPr_def_14)
| ~ c_in(X0,iPr_def_11,iPr_def_14) ),
inference(light_normalisation,[status(thm)],[c_304,c_114]) ).
tcf(c_319,plain,
c_lessequals(iPr_def_13,iPr_def_10,tc_set(tc_set(t_a))),
inference(superposition,[status(thm)],[c_301,c_58]) ).
tcf(c_322,plain,
c_lessequals(iPr_def_13,iPr_def_10,iPr_def_14),
inference(light_normalisation,[status(thm)],[c_319,c_112,c_114]) ).
tcf(c_335,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ c_lessequals(X1,X0,iPr_def_14)
| ~ c_lessequals(X0,X1,tc_set(iPr_def_12)) ),
inference(superposition,[status(thm)],[c_114,c_57]) ).
tcf(c_336,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ c_lessequals(X1,X0,iPr_def_14)
| ~ c_lessequals(X0,X1,iPr_def_14) ),
inference(light_normalisation,[status(thm)],[c_335,c_114]) ).
tcf(c_355,plain,
( c_in(iPr_def_10,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_in(iPr_def_13,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_301,c_59]) ).
tcf(c_359,plain,
( c_in(iPr_def_10,iPr_def_11,iPr_def_14)
| ~ c_in(iPr_def_13,iPr_def_11,iPr_def_14) ),
inference(light_normalisation,[status(thm)],[c_355,c_111,c_112,c_114]) ).
tcf(c_360,plain,
c_in(iPr_def_10,iPr_def_11,iPr_def_14),
inference(forward_subsumption_resolution,[status(thm)],[c_359,c_299]) ).
tcf(c_383,plain,
c_lessequals(iPr_def_10,iPr_def_13,iPr_def_14),
inference(superposition,[status(thm)],[c_360,c_307]) ).
tcf(c_417,plain,
( ( iPr_def_10 = iPr_def_13 )
| ~ c_lessequals(iPr_def_13,iPr_def_10,iPr_def_14) ),
inference(superposition,[status(thm)],[c_383,c_336]) ).
tcf(c_419,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_417,c_300,c_322]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET845-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.08/0.36 % Computer : n005.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 12:11:02 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.42 % Proving...
% 1.54/1.16 % SZS status Started for theBenchmark.p
% 1.54/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.16
% 1.54/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.54/1.16
% 1.54/1.16 % ------ iProver source info
% 1.54/1.16
% 1.54/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.54/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.54/1.16 % git: non_committed_changes: false
% 1.54/1.16
% 1.54/1.16 % ------ Parsing...% successful
% 1.54/1.16
% 1.54/1.16
% 1.54/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.54/1.16
% 1.54/1.16 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.54/1.16
% 1.54/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.54/1.16
% 1.54/1.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.54/1.16 % ------ Proving...
% 1.54/1.16 % ------ Problem Properties
% 1.54/1.16
% 1.54/1.16 %
% 1.54/1.16 % clauses 12
% 1.54/1.16 % conjectures 3
% 1.54/1.16 % EPR 3
% 1.54/1.16 % Horn 12
% 1.54/1.16 % unary 9
% 1.54/1.16 % binary 2
% 1.54/1.16 % lits 16
% 1.54/1.16 % lits eq 8
% 1.54/1.16 % fd_pure 0
% 1.54/1.16 % fd_pseudo 0
% 1.54/1.16 % fd_cond 0
% 1.54/1.16 % fd_pseudo_cond 1
% 1.54/1.16 % AC symbols 0
% 1.54/1.16
% 1.54/1.16 % ------ Schedule dynamic 5 is on
% 1.54/1.16
% 1.54/1.16 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.54/1.16
% 1.54/1.16
% 1.54/1.16 % ------
% 1.54/1.16 % Current options:
% 1.54/1.16 % ------
% 1.54/1.16
% 1.54/1.16
% 1.54/1.16 %
% 1.54/1.16
% 1.54/1.16 % ------ Proving...
% 1.54/1.16 %
% 1.54/1.16
% 1.54/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.16
% 1.54/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.54/1.16
% 1.54/1.16
%------------------------------------------------------------------------------