TSTP Solution File: KLE044+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE044+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:04:00 EDT 2023
% Result : Theorem 14.86s 2.30s
% Output : CNFRefutation 14.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of formulae : 92 ( 72 unt; 0 def)
% Number of atoms : 114 ( 63 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 22 ~; 16 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 142 ( 0 sgn; 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',additive_idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',order) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',star_unfold_right) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',additive_commutativity) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',star_unfold_left) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',multiplicative_right_identity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',multiplicative_left_identity) ).
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',star_induction_right) ).
fof(star_induction_left,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X2)
=> leq(multiplication(star(X1),X3),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',star_induction_left) ).
fof(goals,conjecture,
! [X4] :
( leq(star(addition(one,X4)),star(X4))
& leq(star(X4),star(addition(one,X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p',goals) ).
fof(c_0_13,plain,
! [X18,X19,X20] : addition(X20,addition(X19,X18)) = addition(addition(X20,X19),X18),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_14,plain,
! [X21] : addition(X21,X21) = X21,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_15,plain,
! [X6,X7] :
( ( ~ leq(X6,X7)
| addition(X6,X7) = X7 )
& ( addition(X6,X7) != X7
| leq(X6,X7) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_16,plain,
! [X8] : leq(addition(one,multiplication(X8,star(X8))),star(X8)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_17,plain,
! [X16,X17] : addition(X16,X17) = addition(X17,X16),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_18,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X9] : leq(addition(one,multiplication(star(X9),X9)),star(X9)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
cnf(c_0_24,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]),c_0_22]) ).
cnf(c_0_26,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_28,plain,
! [X22,X23,X24] : multiplication(X22,addition(X23,X24)) = addition(multiplication(X22,X23),multiplication(X22,X24)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_29,plain,
! [X28] : multiplication(X28,one) = X28,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_30,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_18]),c_0_22]) ).
cnf(c_0_31,plain,
addition(one,addition(star(X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_32,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_34,plain,
! [X25,X26,X27] : multiplication(addition(X25,X26),X27) = addition(multiplication(X25,X27),multiplication(X26,X27)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_35,plain,
! [X29] : multiplication(one,X29) = X29,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_36,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_22]) ).
cnf(c_0_38,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_18]) ).
fof(c_0_42,plain,
! [X13,X14,X15] :
( ~ leq(addition(multiplication(X13,X14),X15),X13)
| leq(multiplication(X15,star(X14)),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
fof(c_0_43,plain,
! [X10,X11,X12] :
( ~ leq(addition(multiplication(X10,X11),X12),X11)
| leq(multiplication(star(X10),X12),X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])]) ).
cnf(c_0_44,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_45,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_22]) ).
cnf(c_0_46,plain,
multiplication(star(X1),addition(one,X1)) = star(X1),
inference(spm,[status(thm)],[c_0_40,c_0_22]) ).
cnf(c_0_47,plain,
addition(one,addition(X1,star(X2))) = addition(X1,star(X2)),
inference(spm,[status(thm)],[c_0_41,c_0_27]) ).
cnf(c_0_48,plain,
addition(star(X1),one) = star(X1),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_49,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
leq(addition(multiplication(X1,star(X1)),one),star(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_52,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_53,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_18]),c_0_47]),c_0_48]),c_0_46]) ).
cnf(c_0_54,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_22]) ).
cnf(c_0_55,plain,
leq(star(X1),star(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_33]) ).
cnf(c_0_56,plain,
multiplication(star(X1),star(star(X1))) = star(star(X1)),
inference(spm,[status(thm)],[c_0_52,c_0_48]) ).
cnf(c_0_57,plain,
addition(X1,addition(star(X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_18,c_0_53]) ).
cnf(c_0_58,plain,
leq(multiplication(star(X1),star(X1)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_36]),c_0_55])]) ).
cnf(c_0_59,plain,
addition(X1,multiplication(X1,star(X2))) = multiplication(X1,star(X2)),
inference(spm,[status(thm)],[c_0_37,c_0_48]) ).
cnf(c_0_60,plain,
( leq(star(star(X1)),X1)
| ~ leq(star(X1),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_44]),c_0_56]) ).
cnf(c_0_61,plain,
addition(X1,star(star(X1))) = star(star(X1)),
inference(spm,[status(thm)],[c_0_57,c_0_53]) ).
cnf(c_0_62,plain,
( leq(multiplication(star(X1),multiplication(X1,X2)),X2)
| ~ leq(multiplication(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_19]) ).
cnf(c_0_63,plain,
multiplication(star(X1),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_58]),c_0_22]),c_0_59]) ).
cnf(c_0_64,plain,
multiplication(star(star(X1)),star(X1)) = star(star(X1)),
inference(spm,[status(thm)],[c_0_40,c_0_48]) ).
cnf(c_0_65,plain,
( leq(multiplication(X1,star(addition(X2,one))),star(X2))
| ~ leq(addition(star(X2),X1),star(X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_40]) ).
cnf(c_0_66,plain,
( star(star(X1)) = X1
| ~ leq(star(X1),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_60]),c_0_22]),c_0_61]) ).
cnf(c_0_67,plain,
leq(star(star(X1)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_55])]) ).
fof(c_0_68,negated_conjecture,
~ ! [X4] :
( leq(star(addition(one,X4)),star(X4))
& leq(star(X4),star(addition(one,X4))) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_69,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_70,plain,
leq(star(addition(X1,one)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_48]),c_0_39]),c_0_55])]) ).
cnf(c_0_71,plain,
star(star(star(X1))) = star(X1),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
fof(c_0_72,negated_conjecture,
( ~ leq(star(addition(one,esk1_0)),star(esk1_0))
| ~ leq(star(esk1_0),star(addition(one,esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])])]) ).
cnf(c_0_73,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_52,c_0_22]) ).
cnf(c_0_74,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_69,c_0_19]) ).
cnf(c_0_75,plain,
addition(star(X1),multiplication(star(X1),X2)) = multiplication(star(X1),addition(one,addition(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_46]),c_0_18]) ).
cnf(c_0_76,plain,
addition(star(X1),star(addition(X1,one))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_70]),c_0_22]) ).
cnf(c_0_77,plain,
star(star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_71]),c_0_56]),c_0_53]) ).
cnf(c_0_78,negated_conjecture,
( ~ leq(star(addition(one,esk1_0)),star(esk1_0))
| ~ leq(star(esk1_0),star(addition(one,esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_79,plain,
leq(star(addition(one,X1)),star(X1)),
inference(spm,[status(thm)],[c_0_70,c_0_22]) ).
cnf(c_0_80,plain,
( leq(multiplication(star(X1),multiplication(X2,X3)),X3)
| ~ leq(multiplication(addition(X1,X2),X3),X3) ),
inference(spm,[status(thm)],[c_0_50,c_0_38]) ).
cnf(c_0_81,plain,
multiplication(addition(X1,one),star(addition(X1,one))) = star(addition(X1,one)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_82,plain,
multiplication(star(X1),star(addition(X1,one))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_77]),c_0_59]),c_0_77]),c_0_27]),c_0_63]) ).
cnf(c_0_83,negated_conjecture,
~ leq(star(esk1_0),star(addition(one,esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]) ).
cnf(c_0_84,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_85,plain,
leq(star(X1),star(addition(X1,one))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_39]),c_0_82]),c_0_55])]) ).
cnf(c_0_86,negated_conjecture,
addition(star(esk1_0),star(addition(one,esk1_0))) != star(addition(one,esk1_0)),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_87,plain,
addition(star(X1),star(addition(one,X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_79]),c_0_22]) ).
cnf(c_0_88,plain,
star(addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_85]),c_0_76]) ).
cnf(c_0_89,negated_conjecture,
star(addition(one,esk1_0)) != star(esk1_0),
inference(rw,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,plain,
star(addition(one,X1)) = star(X1),
inference(spm,[status(thm)],[c_0_88,c_0_22]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KLE044+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 04:52:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.QgiSjBFU8V/E---3.1_27314.p
% 14.86/2.30 # Version: 3.1pre001
% 14.86/2.30 # Preprocessing class: FSMSSMSSSSSNFFN.
% 14.86/2.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.86/2.30 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.86/2.30 # Starting new_bool_3 with 300s (1) cores
% 14.86/2.30 # Starting new_bool_1 with 300s (1) cores
% 14.86/2.30 # Starting sh5l with 300s (1) cores
% 14.86/2.30 # new_bool_3 with pid 27393 completed with status 0
% 14.86/2.30 # Result found by new_bool_3
% 14.86/2.30 # Preprocessing class: FSMSSMSSSSSNFFN.
% 14.86/2.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.86/2.30 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.86/2.30 # Starting new_bool_3 with 300s (1) cores
% 14.86/2.30 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 14.86/2.30 # Search class: FHHSM-FFSF21-MFFFFFNN
% 14.86/2.30 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 14.86/2.30 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 14.86/2.30 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 27401 completed with status 0
% 14.86/2.30 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 14.86/2.30 # Preprocessing class: FSMSSMSSSSSNFFN.
% 14.86/2.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.86/2.30 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.86/2.30 # Starting new_bool_3 with 300s (1) cores
% 14.86/2.30 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 14.86/2.30 # Search class: FHHSM-FFSF21-MFFFFFNN
% 14.86/2.30 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 14.86/2.30 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 14.86/2.30 # Preprocessing time : 0.001 s
% 14.86/2.30 # Presaturation interreduction done
% 14.86/2.30
% 14.86/2.30 # Proof found!
% 14.86/2.30 # SZS status Theorem
% 14.86/2.30 # SZS output start CNFRefutation
% See solution above
% 14.86/2.30 # Parsed axioms : 17
% 14.86/2.30 # Removed by relevancy pruning/SinE : 3
% 14.86/2.30 # Initial clauses : 15
% 14.86/2.30 # Removed in clause preprocessing : 0
% 14.86/2.30 # Initial clauses in saturation : 15
% 14.86/2.30 # Processed clauses : 4834
% 14.86/2.30 # ...of these trivial : 380
% 14.86/2.30 # ...subsumed : 3787
% 14.86/2.30 # ...remaining for further processing : 667
% 14.86/2.30 # Other redundant clauses eliminated : 2
% 14.86/2.30 # Clauses deleted for lack of memory : 0
% 14.86/2.30 # Backward-subsumed : 12
% 14.86/2.30 # Backward-rewritten : 144
% 14.86/2.30 # Generated clauses : 104186
% 14.86/2.30 # ...of the previous two non-redundant : 93161
% 14.86/2.30 # ...aggressively subsumed : 0
% 14.86/2.30 # Contextual simplify-reflections : 1
% 14.86/2.30 # Paramodulations : 104184
% 14.86/2.30 # Factorizations : 0
% 14.86/2.30 # NegExts : 0
% 14.86/2.30 # Equation resolutions : 2
% 14.86/2.30 # Total rewrite steps : 210022
% 14.86/2.30 # Propositional unsat checks : 0
% 14.86/2.30 # Propositional check models : 0
% 14.86/2.30 # Propositional check unsatisfiable : 0
% 14.86/2.30 # Propositional clauses : 0
% 14.86/2.30 # Propositional clauses after purity: 0
% 14.86/2.30 # Propositional unsat core size : 0
% 14.86/2.30 # Propositional preprocessing time : 0.000
% 14.86/2.30 # Propositional encoding time : 0.000
% 14.86/2.30 # Propositional solver time : 0.000
% 14.86/2.30 # Success case prop preproc time : 0.000
% 14.86/2.30 # Success case prop encoding time : 0.000
% 14.86/2.30 # Success case prop solver time : 0.000
% 14.86/2.30 # Current number of processed clauses : 496
% 14.86/2.30 # Positive orientable unit clauses : 139
% 14.86/2.30 # Positive unorientable unit clauses: 76
% 14.86/2.30 # Negative unit clauses : 2
% 14.86/2.30 # Non-unit-clauses : 279
% 14.86/2.30 # Current number of unprocessed clauses: 88070
% 14.86/2.30 # ...number of literals in the above : 128116
% 14.86/2.30 # Current number of archived formulas : 0
% 14.86/2.30 # Current number of archived clauses : 171
% 14.86/2.30 # Clause-clause subsumption calls (NU) : 35989
% 14.86/2.30 # Rec. Clause-clause subsumption calls : 35988
% 14.86/2.30 # Non-unit clause-clause subsumptions : 3335
% 14.86/2.30 # Unit Clause-clause subsumption calls : 987
% 14.86/2.30 # Rewrite failures with RHS unbound : 0
% 14.86/2.30 # BW rewrite match attempts : 1489
% 14.86/2.30 # BW rewrite match successes : 289
% 14.86/2.30 # Condensation attempts : 0
% 14.86/2.30 # Condensation successes : 0
% 14.86/2.30 # Termbank termtop insertions : 1897483
% 14.86/2.30
% 14.86/2.30 # -------------------------------------------------
% 14.86/2.30 # User time : 1.723 s
% 14.86/2.30 # System time : 0.096 s
% 14.86/2.30 # Total time : 1.819 s
% 14.86/2.30 # Maximum resident set size: 1724 pages
% 14.86/2.30
% 14.86/2.30 # -------------------------------------------------
% 14.86/2.30 # User time : 1.723 s
% 14.86/2.30 # System time : 0.098 s
% 14.86/2.30 # Total time : 1.822 s
% 14.86/2.30 # Maximum resident set size: 1688 pages
% 14.86/2.30 % E---3.1 exiting
% 14.86/2.31 % E---3.1 exiting
%------------------------------------------------------------------------------