TSTP Solution File: SET860-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET860-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Sat May 4 09:21:01 EDT 2024
% Result : Unsatisfiable 6.40s 1.48s
% Output : CNFRefutation 6.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 17
% Syntax : Number of clauses : 68 ( 10 unt; 19 nHn; 56 RR)
% Number of literals : 152 ( 0 equ; 68 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 142 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
( c_lessequals(v_B,X1,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| ~ c_in(X1,v_C,tc_set(t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_conjecture_2) ).
cnf(cls_Set_OPow__iff__iff2_0,axiom,
( c_in(X1,c_Pow(X2,X3),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OPow__iff__iff2_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OsubsetI_0) ).
cnf(cls_SetInterval_OatLeast__iff__iff2_0,axiom,
( c_in(X3,c_SetInterval_OatLeast(X2,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_SetInterval_OatLeast__iff__iff2_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OsubsetI_1) ).
cnf(clsarity_set_1,axiom,
class_Orderings_Oord(tc_set(X1)),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',clsarity_set_1) ).
cnf(cls_SetInterval_OatLeast__iff__iff1_0,axiom,
( c_lessequals(X3,X2,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatLeast(X3,X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_SetInterval_OatLeast__iff__iff1_0) ).
cnf(cls_Set_OCompl__subset__Compl__iff__iff2_0,axiom,
( c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OCompl__subset__Compl__iff__iff2_0) ).
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OsubsetD_0) ).
cnf(cls_Set_OUnionI_0,axiom,
( c_in(X1,c_Union(X4,X3),X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OUnionI_0) ).
cnf(cls_Set_OComplI_0,axiom,
( c_in(X1,X2,X3)
| c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OComplI_0) ).
cnf(cls_Set_OComplD__dest_0,axiom,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OComplD__dest_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_conjecture_1) ).
cnf(cls_Set_OPow__iff__iff1_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X1,c_Pow(X2,X3),tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OPow__iff__iff1_0) ).
cnf(cls_Set_OUnionE_0,axiom,
( c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,c_Union(X2,X3),X3) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OUnionE_0) ).
cnf(cls_Set_OUnionE_1,axiom,
( c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_Set_OUnionE_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
file('/export/starexec/sandbox/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p',cls_conjecture_0) ).
cnf(c_0_17,negated_conjecture,
( c_lessequals(v_B,X1,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| ~ c_in(X1,v_C,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_18,plain,
( c_in(X1,c_Pow(X2,X3),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OPow__iff__iff2_0]) ).
cnf(c_0_19,negated_conjecture,
( c_lessequals(v_B,X1,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| ~ c_in(X1,v_C,tc_set(t_a)) ),
c_0_17 ).
cnf(c_0_20,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_21,plain,
( c_in(X3,c_SetInterval_OatLeast(X2,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OatLeast__iff__iff2_0]) ).
cnf(c_0_22,plain,
( c_in(X1,c_Pow(X2,X3),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( c_lessequals(v_B,c_Main_OsubsetI__1(v_C,X1,tc_set(t_a)),tc_set(t_a))
| c_lessequals(c_Main_OsubsetI__1(v_C,X1,tc_set(t_a)),v_A,tc_set(t_a))
| c_lessequals(v_C,X1,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_25,plain,
( c_in(X3,c_SetInterval_OatLeast(X2,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
( c_lessequals(v_B,c_Main_OsubsetI__1(v_C,X1,tc_set(t_a)),tc_set(t_a))
| c_lessequals(v_C,X1,tc_set(tc_set(t_a)))
| c_in(c_Main_OsubsetI__1(v_C,X1,tc_set(t_a)),c_Pow(v_A,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
class_Orderings_Oord(tc_set(X1)),
clsarity_set_1 ).
cnf(c_0_28,plain,
( c_lessequals(X3,X2,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatLeast(X3,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OatLeast__iff__iff1_0]) ).
cnf(c_0_29,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
( c_lessequals(v_C,X1,tc_set(tc_set(t_a)))
| c_in(c_Main_OsubsetI__1(v_C,X1,tc_set(t_a)),c_SetInterval_OatLeast(v_B,tc_set(t_a)),tc_set(t_a))
| c_in(c_Main_OsubsetI__1(v_C,X1,tc_set(t_a)),c_Pow(v_A,t_a),tc_set(t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OCompl__subset__Compl__iff__iff2_0]) ).
cnf(c_0_32,plain,
( c_lessequals(X3,X2,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatLeast(X3,X1),X1) ),
c_0_28 ).
cnf(c_0_33,negated_conjecture,
( c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a)))
| c_in(c_Main_OsubsetI__1(v_C,c_Pow(v_A,t_a),tc_set(t_a)),c_SetInterval_OatLeast(v_B,tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_35,plain,
( c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( c_lessequals(v_B,c_Main_OsubsetI__1(v_C,c_Pow(v_A,t_a),tc_set(t_a)),tc_set(t_a))
| c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27])]) ).
cnf(c_0_37,plain,
( c_in(X1,c_Union(X4,X3),X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionI_0]) ).
cnf(c_0_38,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
c_0_34 ).
cnf(c_0_39,negated_conjecture,
( c_lessequals(c_uminus(c_Main_OsubsetI__1(v_C,c_Pow(v_A,t_a),tc_set(t_a)),tc_set(t_a)),c_uminus(v_B,tc_set(t_a)),tc_set(t_a))
| c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( c_in(X1,c_Union(X4,X3),X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X2,X4,tc_set(X3)) ),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
( c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a)))
| c_in(X1,c_uminus(v_B,tc_set(t_a)),t_a)
| ~ c_in(X1,c_uminus(c_Main_OsubsetI__1(v_C,c_Pow(v_A,t_a),tc_set(t_a)),tc_set(t_a)),t_a) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,axiom,
( c_in(X1,X2,X3)
| c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
cls_Set_OComplI_0 ).
cnf(c_0_43,plain,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OComplD__dest_0]) ).
cnf(c_0_44,plain,
( c_lessequals(X1,X2,tc_set(tc_set(X3)))
| c_in(X4,c_Union(X1,X3),X3)
| ~ c_in(X4,c_Main_OsubsetI__1(X1,X2,tc_set(X3)),X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_20]) ).
cnf(c_0_45,negated_conjecture,
( c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a)))
| c_in(X1,c_Main_OsubsetI__1(v_C,c_Pow(v_A,t_a),tc_set(t_a)),t_a)
| c_in(X1,c_uminus(v_B,tc_set(t_a)),t_a) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
c_0_43 ).
cnf(c_0_47,negated_conjecture,
( c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a)))
| c_in(X1,c_uminus(v_B,tc_set(t_a)),t_a)
| c_in(X1,c_Union(v_C,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a)))
| c_in(X1,c_Union(v_C,t_a),t_a)
| ~ c_in(X1,v_B,t_a) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_50,negated_conjecture,
( c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a)))
| c_lessequals(v_B,X1,tc_set(t_a))
| c_in(c_Main_OsubsetI__1(v_B,X1,t_a),c_Union(v_C,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_48,c_0_20]) ).
cnf(c_0_51,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
c_0_49 ).
cnf(c_0_52,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X1,c_Pow(X2,X3),tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OPow__iff__iff1_0]) ).
cnf(c_0_53,negated_conjecture,
c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_50]),c_0_51]) ).
cnf(c_0_54,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X1,c_Pow(X2,X3),tc_set(X3)) ),
c_0_52 ).
cnf(c_0_55,negated_conjecture,
( c_in(X1,c_Pow(v_A,t_a),tc_set(t_a))
| ~ c_in(X1,v_C,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_38,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( c_lessequals(X1,v_A,tc_set(t_a))
| ~ c_in(X1,v_C,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
( c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,c_Union(X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionE_0]) ).
cnf(c_0_58,negated_conjecture,
( c_in(X1,v_A,t_a)
| ~ c_in(X2,v_C,tc_set(t_a))
| ~ c_in(X1,X2,t_a) ),
inference(spm,[status(thm)],[c_0_38,c_0_56]) ).
cnf(c_0_59,plain,
( c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,c_Union(X2,X3),X3) ),
c_0_57 ).
cnf(c_0_60,plain,
( c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionE_1]) ).
cnf(c_0_61,negated_conjecture,
( c_in(X1,v_A,t_a)
| ~ c_in(X1,c_Main_OUnionE__1(X2,v_C,t_a),t_a)
| ~ c_in(X2,c_Union(v_C,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
( c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
c_0_60 ).
cnf(c_0_63,negated_conjecture,
( c_in(X1,v_A,t_a)
| ~ c_in(X1,c_Union(v_C,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_65,negated_conjecture,
( c_lessequals(X1,v_A,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_A,t_a),c_Union(v_C,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_29,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
c_0_64 ).
cnf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_20]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.23 % Problem : SET860-1 : TPTP v8.1.2. Released v3.2.0.
% 0.25/0.24 % Command : run_E %s %d THM
% 0.25/0.46 % Computer : n007.cluster.edu
% 0.25/0.46 % Model : x86_64 x86_64
% 0.25/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.46 % Memory : 8042.1875MB
% 0.25/0.46 % OS : Linux 3.10.0-693.el7.x86_64
% 0.25/0.46 % CPULimit : 300
% 0.25/0.46 % WCLimit : 300
% 0.25/0.46 % DateTime : Fri May 3 10:03:35 EDT 2024
% 0.25/0.46 % CPUTime :
% 0.43/0.69 Running first-order theorem proving
% 0.43/0.69 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/tmp/tmp.aKdD2nPgLz/E---3.1_12433.p
% 6.40/1.48 # Version: 3.1.0
% 6.40/1.48 # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.40/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.40/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.40/1.48 # Starting new_bool_3 with 300s (1) cores
% 6.40/1.48 # Starting new_bool_1 with 300s (1) cores
% 6.40/1.48 # Starting sh5l with 300s (1) cores
% 6.40/1.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12511 completed with status 0
% 6.40/1.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.40/1.48 # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.40/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.40/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.40/1.48 # No SInE strategy applied
% 6.40/1.48 # Search class: FGHSM-SSLM33-MFFFFFNN
% 6.40/1.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.40/1.48 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 6.40/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.40/1.48 # Starting new_bool_3 with 136s (1) cores
% 6.40/1.48 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 6.40/1.48 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 6.40/1.48 # G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 12517 completed with status 0
% 6.40/1.48 # Result found by G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.40/1.48 # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.40/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.40/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.40/1.48 # No SInE strategy applied
% 6.40/1.48 # Search class: FGHSM-SSLM33-MFFFFFNN
% 6.40/1.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.40/1.48 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 6.40/1.48 # Preprocessing time : 0.010 s
% 6.40/1.48 # Presaturation interreduction done
% 6.40/1.48
% 6.40/1.48 # Proof found!
% 6.40/1.48 # SZS status Unsatisfiable
% 6.40/1.48 # SZS output start CNFRefutation
% See solution above
% 6.40/1.48 # Parsed axioms : 1360
% 6.40/1.48 # Removed by relevancy pruning/SinE : 0
% 6.40/1.48 # Initial clauses : 1360
% 6.40/1.48 # Removed in clause preprocessing : 1
% 6.40/1.48 # Initial clauses in saturation : 1359
% 6.40/1.48 # Processed clauses : 11991
% 6.40/1.48 # ...of these trivial : 365
% 6.40/1.48 # ...subsumed : 7371
% 6.40/1.48 # ...remaining for further processing : 4255
% 6.40/1.48 # Other redundant clauses eliminated : 55
% 6.40/1.48 # Clauses deleted for lack of memory : 0
% 6.40/1.48 # Backward-subsumed : 121
% 6.40/1.48 # Backward-rewritten : 338
% 6.40/1.48 # Generated clauses : 34590
% 6.40/1.48 # ...of the previous two non-redundant : 31334
% 6.40/1.48 # ...aggressively subsumed : 0
% 6.40/1.48 # Contextual simplify-reflections : 1
% 6.40/1.48 # Paramodulations : 34497
% 6.40/1.48 # Factorizations : 6
% 6.40/1.48 # NegExts : 0
% 6.40/1.48 # Equation resolutions : 87
% 6.40/1.48 # Disequality decompositions : 0
% 6.40/1.48 # Total rewrite steps : 20786
% 6.40/1.48 # ...of those cached : 18473
% 6.40/1.48 # Propositional unsat checks : 0
% 6.40/1.48 # Propositional check models : 0
% 6.40/1.48 # Propositional check unsatisfiable : 0
% 6.40/1.48 # Propositional clauses : 0
% 6.40/1.48 # Propositional clauses after purity: 0
% 6.40/1.48 # Propositional unsat core size : 0
% 6.40/1.48 # Propositional preprocessing time : 0.000
% 6.40/1.48 # Propositional encoding time : 0.000
% 6.40/1.48 # Propositional solver time : 0.000
% 6.40/1.48 # Success case prop preproc time : 0.000
% 6.40/1.48 # Success case prop encoding time : 0.000
% 6.40/1.48 # Success case prop solver time : 0.000
% 6.40/1.48 # Current number of processed clauses : 2473
% 6.40/1.48 # Positive orientable unit clauses : 363
% 6.40/1.48 # Positive unorientable unit clauses: 5
% 6.40/1.48 # Negative unit clauses : 376
% 6.40/1.48 # Non-unit-clauses : 1729
% 6.40/1.48 # Current number of unprocessed clauses: 19226
% 6.40/1.48 # ...number of literals in the above : 40043
% 6.40/1.48 # Current number of archived formulas : 0
% 6.40/1.48 # Current number of archived clauses : 1782
% 6.40/1.48 # Clause-clause subsumption calls (NU) : 2063543
% 6.40/1.48 # Rec. Clause-clause subsumption calls : 1877321
% 6.40/1.48 # Non-unit clause-clause subsumptions : 3623
% 6.40/1.48 # Unit Clause-clause subsumption calls : 135527
% 6.40/1.48 # Rewrite failures with RHS unbound : 0
% 6.40/1.48 # BW rewrite match attempts : 553
% 6.40/1.48 # BW rewrite match successes : 387
% 6.40/1.48 # Condensation attempts : 0
% 6.40/1.48 # Condensation successes : 0
% 6.40/1.48 # Termbank termtop insertions : 576623
% 6.40/1.48 # Search garbage collected termcells : 1594
% 6.40/1.48
% 6.40/1.48 # -------------------------------------------------
% 6.40/1.48 # User time : 0.716 s
% 6.40/1.48 # System time : 0.026 s
% 6.40/1.48 # Total time : 0.742 s
% 6.40/1.48 # Maximum resident set size: 3900 pages
% 6.40/1.48
% 6.40/1.48 # -------------------------------------------------
% 6.40/1.48 # User time : 3.550 s
% 6.40/1.48 # System time : 0.090 s
% 6.40/1.48 # Total time : 3.640 s
% 6.40/1.48 # Maximum resident set size: 2420 pages
% 6.40/1.48 % E---3.1 exiting
% 6.40/1.48 % E exiting
%------------------------------------------------------------------------------