%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET845-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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 0.07s 5.98s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 34 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f381,axiom,
! [X2,X0,X1] :
( X1 = X0
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__antisym_0) ).
fof(f382,plain,
! [X2,X0,X1] :
( X0 = X1
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(reorient_equations,[],[f381]) ).
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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin_OsuccI_0) ).
fof(f1442,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f1443,negated_conjecture,
v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f1444,negated_conjecture,
v_m != c_Zorn_Osucc(v_S,v_m,t_a),
file('/export/starexec/sandbox/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_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,
inference(cnf_transformation,[],[f1444]) ).
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_1426,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,[],[f382]) ).
tcf(c_4924,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(superposition,[status(thm)],[c_1417,c_1422]) ).
tcf(c_5005,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( c_Zorn_Osucc(X0,X1,X2) = X1 )
| ~ c_lessequals(c_Zorn_Osucc(X0,X1,X2),X1,tc_set(tc_set(X2))) ),
inference(superposition,[status(thm)],[c_1424,c_1426]) ).
tcf(c_5122,plain,
! [X0: $i] :
( c_lessequals(c_Zorn_Osucc(v_S,X0,t_a),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(superposition,[status(thm)],[c_1421,c_4924]) ).
tcf(c_5181,plain,
( ( c_Zorn_Osucc(v_S,v_m,t_a) = v_m )
| ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_5122,c_5005]) ).
tcf(c_5182,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5181,c_1418,c_1416]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET845-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/5.32 % Computer : n012.cluster.edu
% 0.04/5.32 % Model : x86_64 x86_64
% 0.04/5.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.32 % Memory : 8046.5625MB
% 0.04/5.32 % OS : Linux 6.8.0-71-generic
% 0.04/5.32 % CPULimit : 300
% 0.04/5.32 % WCLimit : 300
% 0.04/5.32 % DateTime : Thu Sep 24 12:11:25 UTC 2026
% 0.04/5.32 % CPUTime :
% 0.04/5.32 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/5.34 Running first-order theorem proving
% 0.04/5.34 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/5.35
% 0.04/5.35 % ======== iProver multi-core TPTP/SMT =========
% 0.04/5.35
% 0.04/5.35 % Detected problem language: tptp
% 0.04/5.35 % Proving...
% 0.07/5.98 % SZS status Started for theBenchmark.p
% 0.07/5.98 % SZS status Unsatisfiable for theBenchmark.p
% 0.07/5.98
% 0.07/5.98 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.07/5.98
% 0.07/5.98 % ------ iProver source info
% 0.07/5.98
% 0.07/5.98 % git: date: 2026-07-19 20:42:38 +0200
% 0.07/5.98 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.07/5.98 % git: non_committed_changes: false
% 0.07/5.98
% 0.07/5.98 % ------ Parsing...% successful
% 0.07/5.98
% 0.07/5.98
% 0.07/5.98 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.07/5.98
% 0.07/5.98 % ------ 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 %
% 0.07/5.98
% 0.07/5.98 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.07/5.98
% 0.07/5.98 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.07/5.98 % ------ Proving...
% 0.07/5.98 % ------ Problem Properties
% 0.07/5.98
% 0.07/5.98 %
% 0.07/5.98 % clauses 36
% 0.07/5.98 % conjectures 3
% 0.07/5.98 % EPR 9
% 0.07/5.98 % Horn 33
% 0.07/5.98 % unary 17
% 0.07/5.98 % binary 13
% 0.07/5.98 % lits 62
% 0.07/5.98 % lits eq 13
% 0.07/5.98 % fd_pure 0
% 0.07/5.98 % fd_pseudo 0
% 0.07/5.98 % fd_cond 2
% 0.07/5.98 % fd_pseudo_cond 5
% 0.07/5.98 % AC symbols 0
% 0.07/5.98
% 0.07/5.98 % ------ Schedule dynamic 5 is on
% 0.07/5.98
% 0.07/5.98 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.07/5.98
% 0.07/5.98
% 0.07/5.98 % ------
% 0.07/5.98 % Current options:
% 0.07/5.98 % ------
% 0.07/5.98
% 0.07/5.98
% 0.07/5.98 %
% 0.07/5.98
% 0.07/5.98 % ------ Proving...
% 0.07/5.98 %
% 0.07/5.98
% 0.07/5.98 % SZS status Unsatisfiable for theBenchmark.p
% 0.07/5.98
% 0.07/5.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.07/5.98
% 0.07/5.98
%------------------------------------------------------------------------------