TSTP Solution File: LCL374-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL374-1 : TPTP v8.1.2. Released v2.3.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:12:32 EDT 2023
% Result : Unsatisfiable 99.08s 12.92s
% Output : CNFRefutation 99.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 5
% Syntax : Number of clauses : 101 ( 46 unt; 0 nHn; 27 RR)
% Number of literals : 172 ( 0 equ; 76 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 263 ( 80 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.fya5huYDzT/E---3.1_12073.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.fya5huYDzT/E---3.1_12073.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.fya5huYDzT/E---3.1_12073.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/tmp/tmp.fya5huYDzT/E---3.1_12073.p',cn_3) ).
cnf(prove_cn_31,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,u),u)))),
file('/export/starexec/sandbox/tmp/tmp.fya5huYDzT/E---3.1_12073.p',prove_cn_31) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_9]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_31]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_15,c_0_35]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X3,X5),implies(X2,X5)),X4)) ),
inference(spm,[status(thm)],[c_0_23,c_0_6]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_6]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_40]) ).
cnf(c_0_47,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_33,c_0_41]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X3),implies(implies(X3,X2),X2)))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(implies(X3,implies(X1,X2))),X4))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X3),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_48]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_27,c_0_49]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_12,c_0_50]) ).
cnf(c_0_55,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_51,c_0_31]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(X1,implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,implies(not(X1),X3))),X4))),
inference(spm,[status(thm)],[c_0_21,c_0_54]) ).
cnf(c_0_58,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_6]) ).
cnf(c_0_59,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
is_a_theorem(implies(not(implies(X1,implies(X2,implies(not(X1),X3)))),X4)),
inference(spm,[status(thm)],[c_0_25,c_0_57]) ).
cnf(c_0_61,plain,
( is_a_theorem(implies(not(implies(X1,implies(X2,X3))),X4))
| ~ is_a_theorem(implies(X1,implies(X5,X3)))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_20,c_0_58]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( is_a_theorem(implies(not(implies(X1,implies(X2,X1))),X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(not(implies(X1,implies(X2,X1))),X3)),
inference(spm,[status(thm)],[c_0_63,c_0_60]) ).
cnf(c_0_66,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),not(X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_64]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_15,c_0_65]) ).
cnf(c_0_68,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(X1),not(X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_66]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_33,c_0_67]) ).
cnf(c_0_70,plain,
is_a_theorem(implies(implies(X1,not(not(implies(X1,X2)))),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_36,c_0_11]) ).
cnf(c_0_71,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(implies(not(X2),X2)),implies(not(X2),X2)))) ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_72,plain,
( is_a_theorem(implies(X1,implies(not(implies(X2,X3)),X4)))
| ~ is_a_theorem(implies(not(not(X1)),not(X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_68]) ).
cnf(c_0_73,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_69]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(implies(not(X1),not(not(implies(not(X1),X1)))),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_70]) ).
cnf(c_0_75,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(not(X1)),not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_76,plain,
is_a_theorem(implies(not(not(implies(not(X1),X1))),X1)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,plain,
is_a_theorem(implies(implies(not(not(not(X1))),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_52,c_0_77]) ).
cnf(c_0_79,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,not(X1)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_80,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_15,c_0_78]) ).
cnf(c_0_81,plain,
( is_a_theorem(implies(not(X1),implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_82,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_40]) ).
cnf(c_0_83,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_36,c_0_81]) ).
cnf(c_0_84,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
inference(spm,[status(thm)],[c_0_66,c_0_78]) ).
cnf(c_0_85,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,u),u)))),
prove_cn_31 ).
cnf(c_0_86,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(X2,implies(X1,X3)))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_87,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_55,c_0_6]) ).
cnf(c_0_88,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(not(X2),X4),X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_89,plain,
is_a_theorem(implies(implies(not(not(X1)),X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_33,c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( ~ is_a_theorem(implies(y,implies(x,implies(implies(implies(x,z),u),implies(implies(y,u),u)))))
| ~ is_a_theorem(implies(not(implies(implies(implies(x,z),u),implies(implies(y,u),u))),x)) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X1,X4)) ),
inference(spm,[status(thm)],[c_0_73,c_0_87]) ).
cnf(c_0_92,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_73,c_0_53]) ).
cnf(c_0_93,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_80]) ).
cnf(c_0_94,plain,
is_a_theorem(implies(X1,implies(not(X2),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_95,negated_conjecture,
~ is_a_theorem(implies(not(implies(implies(implies(x,z),u),implies(implies(y,u),u))),x)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]) ).
cnf(c_0_96,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_93]) ).
cnf(c_0_97,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X1,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_36,c_0_94]) ).
cnf(c_0_98,negated_conjecture,
~ is_a_theorem(implies(not(x),implies(implies(implies(x,z),u),implies(implies(y,u),u)))),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_99,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_73,c_0_97]) ).
cnf(c_0_100,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_28]),c_0_99])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL374-1 : TPTP v8.1.2. Released v2.3.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 12:12:45 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.fya5huYDzT/E---3.1_12073.p
% 99.08/12.92 # Version: 3.1pre001
% 99.08/12.92 # Preprocessing class: FSSSSMSSSSSNFFN.
% 99.08/12.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.08/12.92 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 99.08/12.92 # Starting new_bool_3 with 300s (1) cores
% 99.08/12.92 # Starting new_bool_1 with 300s (1) cores
% 99.08/12.92 # Starting sh5l with 300s (1) cores
% 99.08/12.92 # sh5l with pid 12154 completed with status 0
% 99.08/12.92 # Result found by sh5l
% 99.08/12.92 # Preprocessing class: FSSSSMSSSSSNFFN.
% 99.08/12.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.08/12.92 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 99.08/12.92 # Starting new_bool_3 with 300s (1) cores
% 99.08/12.92 # Starting new_bool_1 with 300s (1) cores
% 99.08/12.92 # Starting sh5l with 300s (1) cores
% 99.08/12.92 # SinE strategy is gf500_gu_R04_F100_L20000
% 99.08/12.92 # Search class: FHUNS-FFSF21-MFFFFFNN
% 99.08/12.92 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 99.08/12.92 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 99.08/12.92 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 12160 completed with status 0
% 99.08/12.92 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 99.08/12.92 # Preprocessing class: FSSSSMSSSSSNFFN.
% 99.08/12.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.08/12.92 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 99.08/12.92 # Starting new_bool_3 with 300s (1) cores
% 99.08/12.92 # Starting new_bool_1 with 300s (1) cores
% 99.08/12.92 # Starting sh5l with 300s (1) cores
% 99.08/12.92 # SinE strategy is gf500_gu_R04_F100_L20000
% 99.08/12.92 # Search class: FHUNS-FFSF21-MFFFFFNN
% 99.08/12.92 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 99.08/12.92 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 99.08/12.92 # Preprocessing time : 0.001 s
% 99.08/12.92 # Presaturation interreduction done
% 99.08/12.92
% 99.08/12.92 # Proof found!
% 99.08/12.92 # SZS status Unsatisfiable
% 99.08/12.92 # SZS output start CNFRefutation
% See solution above
% 99.08/12.92 # Parsed axioms : 5
% 99.08/12.92 # Removed by relevancy pruning/SinE : 0
% 99.08/12.92 # Initial clauses : 5
% 99.08/12.92 # Removed in clause preprocessing : 0
% 99.08/12.92 # Initial clauses in saturation : 5
% 99.08/12.92 # Processed clauses : 140004
% 99.08/12.92 # ...of these trivial : 1607
% 99.08/12.92 # ...subsumed : 132462
% 99.08/12.92 # ...remaining for further processing : 5935
% 99.08/12.92 # Other redundant clauses eliminated : 0
% 99.08/12.92 # Clauses deleted for lack of memory : 0
% 99.08/12.92 # Backward-subsumed : 614
% 99.08/12.92 # Backward-rewritten : 60
% 99.08/12.92 # Generated clauses : 789161
% 99.08/12.92 # ...of the previous two non-redundant : 748706
% 99.08/12.92 # ...aggressively subsumed : 0
% 99.08/12.92 # Contextual simplify-reflections : 0
% 99.08/12.92 # Paramodulations : 789161
% 99.08/12.92 # Factorizations : 0
% 99.08/12.92 # NegExts : 0
% 99.08/12.92 # Equation resolutions : 0
% 99.08/12.92 # Total rewrite steps : 47875
% 99.08/12.92 # Propositional unsat checks : 0
% 99.08/12.92 # Propositional check models : 0
% 99.08/12.92 # Propositional check unsatisfiable : 0
% 99.08/12.92 # Propositional clauses : 0
% 99.08/12.92 # Propositional clauses after purity: 0
% 99.08/12.92 # Propositional unsat core size : 0
% 99.08/12.92 # Propositional preprocessing time : 0.000
% 99.08/12.92 # Propositional encoding time : 0.000
% 99.08/12.92 # Propositional solver time : 0.000
% 99.08/12.92 # Success case prop preproc time : 0.000
% 99.08/12.92 # Success case prop encoding time : 0.000
% 99.08/12.92 # Success case prop solver time : 0.000
% 99.08/12.92 # Current number of processed clauses : 5256
% 99.08/12.92 # Positive orientable unit clauses : 878
% 99.08/12.92 # Positive unorientable unit clauses: 0
% 99.08/12.92 # Negative unit clauses : 1667
% 99.08/12.93 # Non-unit-clauses : 2711
% 99.08/12.93 # Current number of unprocessed clauses: 607604
% 99.08/12.93 # ...number of literals in the above : 1892859
% 99.08/12.93 # Current number of archived formulas : 0
% 99.08/12.93 # Current number of archived clauses : 679
% 99.08/12.93 # Clause-clause subsumption calls (NU) : 7928202
% 99.08/12.93 # Rec. Clause-clause subsumption calls : 4984949
% 99.08/12.93 # Non-unit clause-clause subsumptions : 69447
% 99.08/12.93 # Unit Clause-clause subsumption calls : 249193
% 99.08/12.93 # Rewrite failures with RHS unbound : 0
% 99.08/12.93 # BW rewrite match attempts : 359175
% 99.08/12.93 # BW rewrite match successes : 38
% 99.08/12.93 # Condensation attempts : 0
% 99.08/12.93 # Condensation successes : 0
% 99.08/12.93 # Termbank termtop insertions : 11314961
% 99.08/12.93
% 99.08/12.93 # -------------------------------------------------
% 99.08/12.93 # User time : 12.017 s
% 99.08/12.93 # System time : 0.338 s
% 99.08/12.93 # Total time : 12.355 s
% 99.08/12.93 # Maximum resident set size: 1644 pages
% 99.08/12.93
% 99.08/12.93 # -------------------------------------------------
% 99.08/12.93 # User time : 12.018 s
% 99.08/12.93 # System time : 0.340 s
% 99.08/12.93 # Total time : 12.358 s
% 99.08/12.93 # Maximum resident set size: 1676 pages
% 99.08/12.93 % E---3.1 exiting
% 99.08/12.93 % E---3.1 exiting
%------------------------------------------------------------------------------