%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET859-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:49 PM UTC 2026
% Result : Unsatisfiable 3.68s 1.07s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 15 ( 0 sgn 15 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1434,axiom,
! [X2,X3,X0,X1] :
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(X3,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).
fof(f1435,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(f1443,negated_conjecture,
c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f1444,negated_conjecture,
~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
tcf(c_1420,negated_conjecture,
c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1443]) ).
tcf(c_1421,negated_conjecture,
~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1444]) ).
tcf(c_1424,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(X3,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f1434]) ).
tcf(c_1432,plain,
! [X0: $i,X1: $i,X2: $i] : c_lessequals(X0,c_Zorn_Osucc(X1,X0,X2),tc_set(tc_set(X2))),
inference(cnf_transformation,[],[f1435]) ).
tcf(c_4847,plain,
! [X0: $i] :
( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
| ~ c_lessequals(X0,c_Zorn_Osucc(v_S,v_n,t_a),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_1420,c_1424]) ).
tcf(c_4909,plain,
c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
inference(superposition,[status(thm)],[c_1432,c_4847]) ).
tcf(c_4912,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4909,c_1421]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET859-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.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Thu Sep 24 12:15:51 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.03/0.32
% 0.03/0.32 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.32
% 0.03/0.32 % Detected problem language: tptp
% 0.03/0.33 % Proving...
% 3.68/1.07 % SZS status Started for theBenchmark.p
% 3.68/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 3.68/1.07
% 3.68/1.07 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.68/1.07
% 3.68/1.07 % ------ iProver source info
% 3.68/1.07
% 3.68/1.07 % git: date: 2026-07-19 20:42:38 +0200
% 3.68/1.07 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.68/1.07 % git: non_committed_changes: false
% 3.68/1.07
% 3.68/1.07 % ------ Parsing...% successful
% 3.68/1.07
% 3.68/1.07
% 3.68/1.07 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.68/1.07
% 3.68/1.07 % ------ 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.68/1.07
% 3.68/1.07 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.68/1.07
% 3.68/1.07 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.68/1.07 % ------ Proving...
% 3.68/1.07 % ------ Problem Properties
% 3.68/1.07
% 3.68/1.07 %
% 3.68/1.07 % clauses 35
% 3.68/1.07 % conjectures 5
% 3.68/1.07 % EPR 9
% 3.68/1.07 % Horn 31
% 3.68/1.07 % unary 19
% 3.68/1.07 % binary 10
% 3.68/1.07 % lits 59
% 3.68/1.07 % lits eq 11
% 3.68/1.07 % fd_pure 0
% 3.68/1.07 % fd_pseudo 0
% 3.68/1.07 % fd_cond 2
% 3.68/1.07 % fd_pseudo_cond 6
% 3.68/1.07 % AC symbols 0
% 3.68/1.07
% 3.68/1.07 % ------ Schedule dynamic 5 is on
% 3.68/1.07
% 3.68/1.07 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.68/1.07
% 3.68/1.07
% 3.68/1.07 % ------
% 3.68/1.07 % Current options:
% 3.68/1.07 % ------
% 3.68/1.07
% 3.68/1.07
% 3.68/1.07 %
% 3.68/1.07
% 3.68/1.07 % ------ Proving...
% 3.68/1.07 %
% 3.68/1.07
% 3.68/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 3.68/1.07
% 3.68/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.07
% 3.68/1.07
%------------------------------------------------------------------------------