TSTP Solution File: KLE042+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE042+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:47 EDT 2023
% Result : Theorem 32.53s 4.64s
% Output : CNFRefutation 32.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 70 ( 50 unt; 0 def)
% Number of atoms : 92 ( 56 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 24 ~; 16 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 131 ( 0 sgn; 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',additive_idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',order) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',star_unfold_right) ).
fof(goals,conjecture,
! [X4,X5] :
( leq(multiplication(star(multiplication(X4,X5)),X4),multiplication(X4,star(multiplication(X5,X4))))
& leq(multiplication(X4,star(multiplication(X5,X4))),multiplication(star(multiplication(X4,X5)),X4)) ),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',goals) ).
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',star_induction_right) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',multiplicative_associativity) ).
fof(star_induction_left,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X2)
=> leq(multiplication(star(X1),X3),X2) ),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',star_induction_left) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',multiplicative_left_identity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',multiplicative_right_identity) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox/tmp/tmp.DJukTAxPQF/E---3.1_31375.p',star_unfold_left) ).
fof(c_0_14,plain,
! [X27,X28] : addition(X27,X28) = addition(X28,X27),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_15,plain,
! [X29,X30,X31] : addition(X31,addition(X30,X29)) = addition(addition(X31,X30),X29),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_16,plain,
! [X32] : addition(X32,X32) = X32,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_17,plain,
! [X8,X9] :
( ( ~ leq(X8,X9)
| addition(X8,X9) = X9 )
& ( addition(X8,X9) != X9
| leq(X8,X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_18,plain,
! [X10] : leq(addition(one,multiplication(X10,star(X10))),star(X10)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_19,negated_conjecture,
~ ! [X4,X5] :
( leq(multiplication(star(multiplication(X4,X5)),X4),multiplication(X4,star(multiplication(X5,X4))))
& leq(multiplication(X4,star(multiplication(X5,X4))),multiplication(star(multiplication(X4,X5)),X4)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_20,plain,
! [X15,X16,X17] :
( ~ leq(addition(multiplication(X15,X16),X17),X15)
| leq(multiplication(X17,star(X16)),X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
cnf(c_0_21,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,negated_conjecture,
( ~ leq(multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))))
| ~ leq(multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))),multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_27,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_30,plain,
! [X18,X19,X20] : multiplication(X18,multiplication(X19,X20)) = multiplication(multiplication(X18,X19),X20),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_31,plain,
! [X12,X13,X14] :
( ~ leq(addition(multiplication(X12,X13),X14),X13)
| leq(multiplication(star(X12),X14),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])]) ).
fof(c_0_32,plain,
! [X24,X25,X26] : multiplication(addition(X24,X25),X26) = addition(multiplication(X24,X26),multiplication(X25,X26)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_33,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_34,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_24,c_0_25]),c_0_22]),c_0_21]) ).
fof(c_0_35,plain,
! [X34] : multiplication(one,X34) = X34,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_36,negated_conjecture,
( ~ leq(multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))))
| ~ leq(multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))),multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X3,addition(multiplication(X3,X2),X1)) != X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_29]) ).
cnf(c_0_38,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_22]) ).
cnf(c_0_40,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_44,plain,
! [X21,X22,X23] : multiplication(X21,addition(X22,X23)) = addition(multiplication(X21,X22),multiplication(X21,X23)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_45,plain,
! [X33] : multiplication(X33,one) = X33,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_46,plain,
! [X11] : leq(addition(one,multiplication(star(X11),X11)),star(X11)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
cnf(c_0_47,negated_conjecture,
( addition(esk1_0,addition(multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),multiplication(star(multiplication(esk1_0,esk2_0)),multiplication(esk1_0,multiplication(esk2_0,esk1_0))))) != multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0)
| ~ leq(multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),multiplication(esk1_0,star(multiplication(esk2_0,esk1_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_21]),c_0_39]) ).
cnf(c_0_48,plain,
( leq(multiplication(star(X1),X2),X3)
| addition(X3,addition(multiplication(X1,X3),X2)) != X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_22]),c_0_29]) ).
cnf(c_0_49,plain,
addition(X1,multiplication(star(X2),X1)) = multiplication(star(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_50,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( addition(esk1_0,addition(multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),multiplication(star(multiplication(esk1_0,esk2_0)),multiplication(esk1_0,multiplication(esk2_0,esk1_0))))) != multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0)
| addition(esk1_0,addition(multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))),multiplication(esk1_0,multiplication(esk2_0,multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))))))) != multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_38]),c_0_21]),c_0_39]) ).
cnf(c_0_54,plain,
addition(X1,addition(multiplication(star(X2),X1),X3)) = addition(multiplication(star(X2),X1),X3),
inference(spm,[status(thm)],[c_0_22,c_0_49]) ).
cnf(c_0_55,plain,
addition(X1,multiplication(X1,star(X2))) = multiplication(X1,star(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_42]),c_0_51]) ).
cnf(c_0_56,plain,
leq(addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2))))),star(multiplication(X1,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_57,plain,
addition(one,addition(star(X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_22,c_0_42]) ).
cnf(c_0_58,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_59,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_24,c_0_52]),c_0_22]),c_0_21]) ).
cnf(c_0_60,negated_conjecture,
( addition(esk1_0,addition(multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))),multiplication(esk1_0,multiplication(esk2_0,multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))))))) != multiplication(esk1_0,star(multiplication(esk2_0,esk1_0)))
| addition(multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),multiplication(star(multiplication(esk1_0,esk2_0)),multiplication(esk1_0,multiplication(esk2_0,esk1_0)))) != multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0) ),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
addition(X1,addition(multiplication(X1,star(X2)),X3)) = addition(multiplication(X1,star(X2)),X3),
inference(spm,[status(thm)],[c_0_22,c_0_55]) ).
cnf(c_0_62,plain,
addition(star(multiplication(X1,X2)),multiplication(X1,multiplication(X2,star(multiplication(X1,X2))))) = star(multiplication(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_56]),c_0_22]),c_0_21]),c_0_57]) ).
cnf(c_0_63,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_22]),c_0_21]),c_0_33]) ).
cnf(c_0_64,negated_conjecture,
( addition(multiplication(esk1_0,star(multiplication(esk2_0,esk1_0))),multiplication(esk1_0,multiplication(esk2_0,multiplication(esk1_0,star(multiplication(esk2_0,esk1_0)))))) != multiplication(esk1_0,star(multiplication(esk2_0,esk1_0)))
| addition(multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),multiplication(star(multiplication(esk1_0,esk2_0)),multiplication(esk1_0,multiplication(esk2_0,esk1_0)))) != multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0) ),
inference(rw,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
addition(multiplication(X1,star(multiplication(X2,X3))),multiplication(X1,multiplication(X2,multiplication(X3,star(multiplication(X2,X3)))))) = multiplication(X1,star(multiplication(X2,X3))),
inference(spm,[status(thm)],[c_0_50,c_0_62]) ).
cnf(c_0_66,plain,
addition(multiplication(star(X1),X2),multiplication(star(X1),multiplication(X1,X2))) = multiplication(star(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_63]),c_0_38]) ).
cnf(c_0_67,negated_conjecture,
addition(multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),multiplication(star(multiplication(esk1_0,esk2_0)),multiplication(esk1_0,multiplication(esk2_0,esk1_0)))) != multiplication(star(multiplication(esk1_0,esk2_0)),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_68,plain,
addition(multiplication(star(multiplication(X1,X2)),X3),multiplication(star(multiplication(X1,X2)),multiplication(X1,multiplication(X2,X3)))) = multiplication(star(multiplication(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_66,c_0_38]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE042+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 05:02:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/tmp/tmp.DJukTAxPQF/E---3.1_31375.p
% 32.53/4.64 # Version: 3.1pre001
% 32.53/4.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 32.53/4.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.53/4.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.53/4.64 # Starting new_bool_3 with 300s (1) cores
% 32.53/4.64 # Starting new_bool_1 with 300s (1) cores
% 32.53/4.64 # Starting sh5l with 300s (1) cores
% 32.53/4.64 # new_bool_1 with pid 31492 completed with status 0
% 32.53/4.64 # Result found by new_bool_1
% 32.53/4.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 32.53/4.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.53/4.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.53/4.64 # Starting new_bool_3 with 300s (1) cores
% 32.53/4.64 # Starting new_bool_1 with 300s (1) cores
% 32.53/4.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 32.53/4.64 # Search class: FHHSM-FFSF21-MFFFFFNN
% 32.53/4.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 32.53/4.64 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 32.53/4.64 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 31500 completed with status 0
% 32.53/4.64 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 32.53/4.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 32.53/4.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.53/4.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.53/4.64 # Starting new_bool_3 with 300s (1) cores
% 32.53/4.64 # Starting new_bool_1 with 300s (1) cores
% 32.53/4.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 32.53/4.64 # Search class: FHHSM-FFSF21-MFFFFFNN
% 32.53/4.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 32.53/4.64 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 32.53/4.64 # Preprocessing time : 0.001 s
% 32.53/4.64 # Presaturation interreduction done
% 32.53/4.64
% 32.53/4.64 # Proof found!
% 32.53/4.64 # SZS status Theorem
% 32.53/4.64 # SZS output start CNFRefutation
% See solution above
% 32.53/4.64 # Parsed axioms : 17
% 32.53/4.64 # Removed by relevancy pruning/SinE : 3
% 32.53/4.64 # Initial clauses : 15
% 32.53/4.64 # Removed in clause preprocessing : 0
% 32.53/4.64 # Initial clauses in saturation : 15
% 32.53/4.64 # Processed clauses : 17658
% 32.53/4.64 # ...of these trivial : 1335
% 32.53/4.64 # ...subsumed : 14142
% 32.53/4.64 # ...remaining for further processing : 2181
% 32.53/4.64 # Other redundant clauses eliminated : 317
% 32.53/4.64 # Clauses deleted for lack of memory : 0
% 32.53/4.64 # Backward-subsumed : 401
% 32.53/4.64 # Backward-rewritten : 179
% 32.53/4.64 # Generated clauses : 349467
% 32.53/4.64 # ...of the previous two non-redundant : 277308
% 32.53/4.64 # ...aggressively subsumed : 0
% 32.53/4.64 # Contextual simplify-reflections : 3
% 32.53/4.64 # Paramodulations : 349144
% 32.53/4.64 # Factorizations : 0
% 32.53/4.64 # NegExts : 0
% 32.53/4.64 # Equation resolutions : 323
% 32.53/4.64 # Total rewrite steps : 715029
% 32.53/4.64 # Propositional unsat checks : 0
% 32.53/4.64 # Propositional check models : 0
% 32.53/4.64 # Propositional check unsatisfiable : 0
% 32.53/4.64 # Propositional clauses : 0
% 32.53/4.64 # Propositional clauses after purity: 0
% 32.53/4.64 # Propositional unsat core size : 0
% 32.53/4.64 # Propositional preprocessing time : 0.000
% 32.53/4.64 # Propositional encoding time : 0.000
% 32.53/4.64 # Propositional solver time : 0.000
% 32.53/4.64 # Success case prop preproc time : 0.000
% 32.53/4.64 # Success case prop encoding time : 0.000
% 32.53/4.64 # Success case prop solver time : 0.000
% 32.53/4.64 # Current number of processed clauses : 1586
% 32.53/4.64 # Positive orientable unit clauses : 401
% 32.53/4.64 # Positive unorientable unit clauses: 9
% 32.53/4.64 # Negative unit clauses : 6
% 32.53/4.64 # Non-unit-clauses : 1170
% 32.53/4.64 # Current number of unprocessed clauses: 256751
% 32.53/4.64 # ...number of literals in the above : 620004
% 32.53/4.64 # Current number of archived formulas : 0
% 32.53/4.64 # Current number of archived clauses : 595
% 32.53/4.64 # Clause-clause subsumption calls (NU) : 329355
% 32.53/4.64 # Rec. Clause-clause subsumption calls : 199210
% 32.53/4.64 # Non-unit clause-clause subsumptions : 13374
% 32.53/4.64 # Unit Clause-clause subsumption calls : 17584
% 32.53/4.64 # Rewrite failures with RHS unbound : 0
% 32.53/4.64 # BW rewrite match attempts : 7056
% 32.53/4.64 # BW rewrite match successes : 298
% 32.53/4.64 # Condensation attempts : 0
% 32.53/4.64 # Condensation successes : 0
% 32.53/4.64 # Termbank termtop insertions : 6988873
% 32.53/4.64
% 32.53/4.64 # -------------------------------------------------
% 32.53/4.64 # User time : 3.870 s
% 32.53/4.64 # System time : 0.157 s
% 32.53/4.64 # Total time : 4.026 s
% 32.53/4.64 # Maximum resident set size: 1760 pages
% 32.53/4.64
% 32.53/4.64 # -------------------------------------------------
% 32.53/4.64 # User time : 3.871 s
% 32.53/4.64 # System time : 0.159 s
% 32.53/4.64 # Total time : 4.030 s
% 32.53/4.64 # Maximum resident set size: 1688 pages
% 32.53/4.64 % E---3.1 exiting
%------------------------------------------------------------------------------