TSTP Solution File: SET858-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET858-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:00:13 EDT 2024
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 15 unt; 30 nHn; 51 RR)
% Number of literals : 153 ( 16 equ; 67 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 105 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Zorn_OTFin__linear__lemma1_1,axiom,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_1) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_n,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_n,v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Set_Osubset__trans_0,axiom,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).
cnf(cls_Set_OpsubsetI_0,axiom,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetI_0) ).
cnf(cls_conjecture_0,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) ).
cnf(cls_Zorn_OAbrial__axiom1_0,axiom,
c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OAbrial__axiom1_0) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(v_m,v_n,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Set_OpsubsetE_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetE_1) ).
cnf(cls_Zorn_OTFin__linear__lemma2_0,axiom,
( c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| X1 = X4
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(X1,X4,tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma2_0) ).
cnf(cls_Zorn_OTFin__linear__lemma1_0,axiom,
( c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,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_3,axiom,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_3) ).
cnf(cls_Zorn_OTFin__linear__lemma1_2,axiom,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_2) ).
cnf(c_0_13,plain,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_1]) ).
cnf(c_0_14,plain,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
c_0_13 ).
cnf(c_0_15,negated_conjecture,
c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_1 ).
cnf(c_0_16,negated_conjecture,
~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_17,plain,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__trans_0]) ).
cnf(c_0_18,plain,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetI_0]) ).
cnf(c_0_19,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_n,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(v_n,X1,tc_set(tc_set(t_a)))
| ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_21,negated_conjecture,
~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
c_0_16 ).
cnf(c_0_22,plain,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
c_0_17 ).
cnf(c_0_23,axiom,
c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
cls_Zorn_OAbrial__axiom1_0 ).
cnf(c_0_24,plain,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
c_0_18 ).
cnf(c_0_25,negated_conjecture,
( c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ c_lessequals(v_m,v_n,tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_27,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetE_1]) ).
cnf(c_0_28,plain,
( c_lessequals(X1,X2,tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Osucc(X4,X1,X3),X2,tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) = v_m
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a)))
| c_less(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ c_lessequals(v_m,v_n,tc_set(tc_set(t_a))),
c_0_26 ).
cnf(c_0_31,plain,
( c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| X1 = X4
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(X1,X4,tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma2_0]) ).
cnf(c_0_32,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
( c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) = v_m
| c_less(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
( c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_0]) ).
cnf(c_0_35,plain,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_3]) ).
cnf(c_0_36,plain,
( c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| X1 = X4
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(X1,X4,tc_set(tc_set(X3))) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) = v_m
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
c_0_34 ).
cnf(c_0_39,plain,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3))) ),
c_0_35 ).
cnf(c_0_40,negated_conjecture,
( c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) = v_m
| c_lessequals(c_Zorn_Osucc(X1,c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),t_a),v_m,tc_set(tc_set(t_a)))
| ~ c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),c_Zorn_OTFin(X1,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_m,c_Zorn_OTFin(X1,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_n,tc_set(tc_set(t_a)))
| c_lessequals(v_n,X1,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_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_38,c_0_15]) ).
cnf(c_0_42,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_n,tc_set(tc_set(t_a)))
| c_lessequals(v_n,X1,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),X1,tc_set(tc_set(t_a)))
| ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_43,negated_conjecture,
( c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) = v_m
| c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),t_a),v_m,tc_set(tc_set(t_a)))
| ~ c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_40,c_0_20]) ).
cnf(c_0_44,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a)))
| c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_20]),c_0_21]) ).
cnf(c_0_45,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a)))
| ~ c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),t_a),v_m,tc_set(tc_set(t_a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_20]),c_0_21]) ).
cnf(c_0_46,plain,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1 ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_2]) ).
cnf(c_0_47,negated_conjecture,
( c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) = v_m
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_48,plain,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1 ),
c_0_46 ).
cnf(c_0_49,negated_conjecture,
c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) = v_m,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_47]),c_0_30]) ).
cnf(c_0_50,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a)))
| c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_20])]) ).
cnf(c_0_51,negated_conjecture,
c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_15]),c_0_21]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_51]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET858-1 : TPTP v8.2.0. Released v3.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 11:44:22 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.51 # Version: 3.1.0
% 0.18/0.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 # Starting sh5l with 300s (1) cores
% 0.18/0.51 # new_bool_3 with pid 2405 completed with status 0
% 0.18/0.51 # Result found by new_bool_3
% 0.18/0.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.18/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 0.18/0.51 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 2409 completed with status 0
% 0.18/0.51 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.18/0.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.18/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 0.18/0.51 # Preprocessing time : 0.003 s
% 0.18/0.51
% 0.18/0.51 # Proof found!
% 0.18/0.51 # SZS status Unsatisfiable
% 0.18/0.51 # SZS output start CNFRefutation
% See solution above
% 0.18/0.51 # Parsed axioms : 1368
% 0.18/0.51 # Removed by relevancy pruning/SinE : 981
% 0.18/0.51 # Initial clauses : 387
% 0.18/0.51 # Removed in clause preprocessing : 0
% 0.18/0.51 # Initial clauses in saturation : 387
% 0.18/0.51 # Processed clauses : 526
% 0.18/0.51 # ...of these trivial : 1
% 0.18/0.51 # ...subsumed : 87
% 0.18/0.51 # ...remaining for further processing : 438
% 0.18/0.51 # Other redundant clauses eliminated : 0
% 0.18/0.51 # Clauses deleted for lack of memory : 0
% 0.18/0.51 # Backward-subsumed : 4
% 0.18/0.51 # Backward-rewritten : 27
% 0.18/0.51 # Generated clauses : 258
% 0.18/0.51 # ...of the previous two non-redundant : 197
% 0.18/0.51 # ...aggressively subsumed : 0
% 0.18/0.51 # Contextual simplify-reflections : 1
% 0.18/0.51 # Paramodulations : 255
% 0.18/0.51 # Factorizations : 0
% 0.18/0.51 # NegExts : 0
% 0.18/0.51 # Equation resolutions : 3
% 0.18/0.51 # Disequality decompositions : 0
% 0.18/0.51 # Total rewrite steps : 121
% 0.18/0.51 # ...of those cached : 85
% 0.18/0.51 # Propositional unsat checks : 0
% 0.18/0.51 # Propositional check models : 0
% 0.18/0.51 # Propositional check unsatisfiable : 0
% 0.18/0.51 # Propositional clauses : 0
% 0.18/0.51 # Propositional clauses after purity: 0
% 0.18/0.51 # Propositional unsat core size : 0
% 0.18/0.51 # Propositional preprocessing time : 0.000
% 0.18/0.51 # Propositional encoding time : 0.000
% 0.18/0.51 # Propositional solver time : 0.000
% 0.18/0.51 # Success case prop preproc time : 0.000
% 0.18/0.51 # Success case prop encoding time : 0.000
% 0.18/0.51 # Success case prop solver time : 0.000
% 0.18/0.51 # Current number of processed clauses : 407
% 0.18/0.51 # Positive orientable unit clauses : 45
% 0.18/0.51 # Positive unorientable unit clauses: 0
% 0.18/0.51 # Negative unit clauses : 8
% 0.18/0.51 # Non-unit-clauses : 354
% 0.18/0.51 # Current number of unprocessed clauses: 42
% 0.18/0.51 # ...number of literals in the above : 146
% 0.18/0.51 # Current number of archived formulas : 0
% 0.18/0.51 # Current number of archived clauses : 31
% 0.18/0.51 # Clause-clause subsumption calls (NU) : 46398
% 0.18/0.51 # Rec. Clause-clause subsumption calls : 39305
% 0.18/0.51 # Non-unit clause-clause subsumptions : 86
% 0.18/0.51 # Unit Clause-clause subsumption calls : 62
% 0.18/0.51 # Rewrite failures with RHS unbound : 0
% 0.18/0.51 # BW rewrite match attempts : 8
% 0.18/0.51 # BW rewrite match successes : 3
% 0.18/0.51 # Condensation attempts : 0
% 0.18/0.51 # Condensation successes : 0
% 0.18/0.51 # Termbank termtop insertions : 18490
% 0.18/0.51 # Search garbage collected termcells : 2519
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.026 s
% 0.18/0.51 # System time : 0.005 s
% 0.18/0.51 # Total time : 0.031 s
% 0.18/0.51 # Maximum resident set size: 3116 pages
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.039 s
% 0.18/0.51 # System time : 0.007 s
% 0.18/0.51 # Total time : 0.046 s
% 0.18/0.51 # Maximum resident set size: 2412 pages
% 0.18/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------