%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET853-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 : Thu Sep 24 02:18:44 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 19 unt; 21 nHn; 43 RR)
% Number of literals : 137 ( 17 equ; 64 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 82 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Zorn_OTFin__linear__lemma1_0,axiom,
( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_0) ).
cnf(cls_Zorn_OTFin__linear__lemma1_2,axiom,
( c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_2) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_conjecture_3,negated_conjecture,
v_xa != c_Zorn_Osucc(v_S,v_x,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
| X1 = v_x
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_x,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Zorn_OTFin__linear__lemma1_3,axiom,
( ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_3) ).
cnf(cls_conjecture_0,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_0) ).
cnf(cls_Zorn_OTFin__linear__lemma1_1,axiom,
( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_1) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_Zorn_Osucc__trans_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
| c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Osucc__trans_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).
cnf(c_0_13,plain,
( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_0]) ).
cnf(c_0_14,plain,
( c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_2]) ).
cnf(c_0_15,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_16,negated_conjecture,
v_xa != c_Zorn_Osucc(v_S,v_x,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
| X1 = v_x
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_x,tc_set(tc_set(t_a))) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_18,plain,
( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_1 ).
cnf(c_0_20,plain,
( c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
c_0_14 ).
cnf(c_0_21,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
cls_conjecture_2 ).
cnf(c_0_23,negated_conjecture,
v_xa != c_Zorn_Osucc(v_S,v_x,t_a),
c_0_16 ).
cnf(c_0_24,plain,
( ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_3]) ).
cnf(c_0_25,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
| X1 = v_x
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_x,tc_set(tc_set(t_a))) ),
c_0_17 ).
cnf(c_0_26,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_lessequals(v_xa,X1,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_xa,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a) != X1
| c_lessequals(v_xa,X1,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_xa,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_29,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_30,plain,
( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_1]) ).
cnf(c_0_31,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_32,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
| c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Osucc__trans_0]) ).
cnf(c_0_33,plain,
( ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
c_0_24 ).
cnf(c_0_34,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a),v_x,tc_set(tc_set(t_a)))
| c_lessequals(v_xa,X1,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_xa,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a),t_a),v_x,tc_set(tc_set(t_a)))
| c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a) = v_x ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) != v_x
| c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_36,plain,
( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
c_0_30 ).
cnf(c_0_37,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
c_0_31 ).
cnf(c_0_38,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
| c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))
| c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
| c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X1,tc_set(tc_set(t_a))) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28])]),c_0_29]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_lessequals(v_xa,X1,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a),X1,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_xa,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_41,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
| c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X1,tc_set(tc_set(t_a))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_28])]),c_0_29]) ).
cnf(c_0_43,negated_conjecture,
( ~ c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
| v_xa = v_x ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_19]),c_0_29]) ).
cnf(c_0_45,negated_conjecture,
v_xa = v_x,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_46,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_45]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET853-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.39 % Computer : n019.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 : Mon Sep 21 05:41:41 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/5.46 % Version: 3.5.1
% 0.16/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.46 % Starting sh5l with 300s (1) cores
% 0.16/5.46 % sh5l with pid 1799549 completed with status 0
% 0.16/5.46 % Result found by sh5l
% 0.16/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.46 % Starting sh5l with 300s (1) cores
% 0.16/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.46 % Search class: FGUSF-FFMS32-SFFFFFNN
% 0.16/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.46 % SubtermCWHack with pid 1799551 completed with status 0
% 0.16/5.46 % Result found by SubtermCWHack
% 0.16/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.46 % Starting sh5l with 300s (1) cores
% 0.16/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.46 % Search class: FGUSF-FFMS32-SFFFFFNN
% 0.16/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.46 % Preprocessing time : 0.001 s
% 0.16/5.46
% 0.16/5.46 % Proof found!
% 0.16/5.46 % SZS status Unsatisfiable
% 0.16/5.46 % SZS output start CNFRefutation
% See solution above
% 0.16/5.46 % Parsed axioms : 13
% 0.16/5.46 % Removed by relevancy pruning/SinE : 0
% 0.16/5.46 % Initial clauses : 13
% 0.16/5.46 % Removed in clause preprocessing : 0
% 0.16/5.46 % Initial clauses in saturation : 13
% 0.16/5.46 % Processed clauses : 43
% 0.16/5.46 % ...of these trivial : 0
% 0.16/5.46 % ...subsumed : 2
% 0.16/5.46 % ...remaining for further processing : 41
% 0.16/5.46 % Other redundant clauses eliminated : 0
% 0.16/5.46 % Clauses deleted for lack of memory : 0
% 0.16/5.46 % Backward-subsumed : 1
% 0.16/5.46 % Backward-rewritten : 14
% 0.16/5.46 % Generated clauses : 56
% 0.16/5.46 % ...of the previous two non-redundant : 59
% 0.16/5.46 % ...aggressively subsumed : 0
% 0.16/5.46 % Contextual simplify-reflections : 3
% 0.16/5.46 % Paramodulations : 56
% 0.16/5.46 % Factorizations : 0
% 0.16/5.46 % NegExts : 0
% 0.16/5.46 % Equation resolutions : 0
% 0.16/5.46 % Disequality decompositions : 0
% 0.16/5.46 % Total rewrite steps : 32
% 0.16/5.46 % ...of those cached : 26
% 0.16/5.46 % Propositional unsat checks : 0
% 0.16/5.46 % Propositional check models : 0
% 0.16/5.46 % Propositional check unsatisfiable : 0
% 0.16/5.46 % Propositional clauses : 0
% 0.16/5.46 % Propositional clauses after purity: 0
% 0.16/5.46 % Propositional unsat core size : 0
% 0.16/5.46 % Propositional preprocessing time : 0.000
% 0.16/5.46 % Propositional encoding time : 0.000
% 0.16/5.46 % Propositional solver time : 0.000
% 0.16/5.46 % Success case prop preproc time : 0.000
% 0.16/5.46 % Success case prop encoding time : 0.000
% 0.16/5.46 % Success case prop solver time : 0.000
% 0.16/5.46 % Current number of processed clauses : 26
% 0.16/5.46 % Positive orientable unit clauses : 3
% 0.16/5.46 % Positive unorientable unit clauses: 0
% 0.16/5.46 % Negative unit clauses : 2
% 0.16/5.46 % Non-unit-clauses : 21
% 0.16/5.46 % Current number of unprocessed clauses: 21
% 0.16/5.46 % ...number of literals in the above : 119
% 0.16/5.46 % Current number of archived formulas : 0
% 0.16/5.46 % Current number of archived clauses : 15
% 0.16/5.46 % Clause-clause subsumption calls (NU) : 292
% 0.16/5.46 % Rec. Clause-clause subsumption calls : 122
% 0.16/5.46 % Non-unit clause-clause subsumptions : 6
% 0.16/5.46 % Unit Clause-clause subsumption calls : 15
% 0.16/5.46 % Rewrite failures with RHS unbound : 0
% 0.16/5.46 % BW rewrite match attempts : 2
% 0.16/5.46 % BW rewrite match successes : 2
% 0.16/5.46 % Condensation attempts : 0
% 0.16/5.46 % Condensation successes : 0
% 0.16/5.46 % Termbank termtop insertions : 2953
% 0.16/5.46 % Search garbage collected termcells : 35
% 0.16/5.46
% 0.16/5.46 % -------------------------------------------------
% 0.16/5.46 % User time : 0.007 s
% 0.16/5.46 % System time : 0.002 s
% 0.16/5.46 % Total time : 0.009 s
% 0.16/5.46 % Maximum resident set size: 3640 pages
% 0.16/5.46
% 0.16/5.46 % -------------------------------------------------
% 0.16/5.46 % User time : 0.007 s
% 0.16/5.46 % System time : 0.008 s
% 0.16/5.46 % Total time : 0.015 s
% 0.16/5.46 % Maximum resident set size: 4864 pages
% 0.16/5.46 % E exiting
%------------------------------------------------------------------------------