%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET841-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 : n014.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:45 PM UTC 2026
% Result : Unsatisfiable 4.10s 1.28s
% Output : CNFRefutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 19 ( 16 unt; 0 def)
% Number of atoms : 30 ( 6 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 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; 4 con; 0-3 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f383,axiom,
! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
fof(f1434,axiom,
! [X2,X3,X0,X1] :
( X0 = X3
| c_lessequals(c_Zorn_Osucc(X1,X0,X2),X3,tc_set(tc_set(X2)))
| ~ c_lessequals(X0,X3,tc_set(tc_set(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/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__subsetD_0) ).
fof(f1435,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(f1436,negated_conjecture,
v_m = c_Zorn_Osucc(v_S,v_m,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f1437,negated_conjecture,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f1438,negated_conjecture,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
fof(f1439,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
tcf(c_1412,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1435]) ).
tcf(c_1413,negated_conjecture,
c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
inference(cnf_transformation,[],[f1436]) ).
tcf(c_1414,negated_conjecture,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1437]) ).
tcf(c_1415,negated_conjecture,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1438]) ).
tcf(c_1416,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1439]) ).
tcf(c_1417,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(c_Zorn_Osucc(X1,X0,X2),X3,tc_set(tc_set(X2)))
| ( X0 = X3 )
| ~ c_lessequals(X0,X3,tc_set(tc_set(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))) ),
inference(cnf_transformation,[],[f1434]) ).
tcf(c_1418,plain,
! [X0: $i,X1: $i] : c_lessequals(X0,X0,tc_set(X1)),
inference(cnf_transformation,[],[f383]) ).
tcf(c_4801,plain,
( ( v_m = v_x )
| ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_1417,c_1416]) ).
tcf(c_4803,plain,
v_m = v_x,
inference(forward_subsumption_resolution,[status(thm)],[c_4801,c_1415,c_1414,c_1412]) ).
tcf(c_4810,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))),
inference(demodulation,[status(thm)],[c_1416,c_4803]) ).
tcf(c_4813,plain,
~ c_lessequals(v_m,v_m,tc_set(tc_set(t_a))),
inference(light_normalisation,[status(thm)],[c_4810,c_1413]) ).
tcf(c_4814,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4813,c_1418]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET841-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Thu Sep 24 12:09:49 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.39 Running first-order theorem proving
% 0.03/0.39 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.40
% 0.03/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.40
% 0.03/0.40 % Detected problem language: tptp
% 0.03/0.41 % Proving...
% 4.10/1.28 % SZS status Started for theBenchmark.p
% 4.10/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 4.10/1.28
% 4.10/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.10/1.28
% 4.10/1.28 % ------ iProver source info
% 4.10/1.28
% 4.10/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 4.10/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.10/1.28 % git: non_committed_changes: false
% 4.10/1.28
% 4.10/1.28 % ------ Parsing...% successful
% 4.10/1.28
% 4.10/1.28
% 4.10/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.10/1.28
% 4.10/1.28 % ------ 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 %
% 4.10/1.28
% 4.10/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.10/1.28
% 4.10/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.10/1.28 % ------ Proving...
% 4.10/1.28 % ------ Problem Properties
% 4.10/1.28
% 4.10/1.28 %
% 4.10/1.28 % clauses 33
% 4.10/1.28 % conjectures 5
% 4.10/1.28 % EPR 9
% 4.10/1.28 % Horn 29
% 4.10/1.28 % unary 18
% 4.10/1.28 % binary 10
% 4.10/1.28 % lits 55
% 4.10/1.28 % lits eq 12
% 4.10/1.28 % fd_pure 0
% 4.10/1.28 % fd_pseudo 0
% 4.10/1.28 % fd_cond 2
% 4.10/1.28 % fd_pseudo_cond 6
% 4.10/1.28 % AC symbols 0
% 4.10/1.28
% 4.10/1.28 % ------ Schedule dynamic 5 is on
% 4.10/1.28
% 4.10/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.10/1.28
% 4.10/1.28
% 4.10/1.28 % ------
% 4.10/1.28 % Current options:
% 4.10/1.28 % ------
% 4.10/1.28
% 4.10/1.28
% 4.10/1.28 %
% 4.10/1.28
% 4.10/1.28 % ------ Proving...
% 4.10/1.28 %
% 4.10/1.28
% 4.10/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 4.10/1.28
% 4.10/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.10/1.28
% 4.10/1.28
%------------------------------------------------------------------------------