TSTP Solution File: KLE041+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE041+1 : 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:03:59 EDT 2023
% Result : Theorem 0.21s 0.63s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 89 ( 67 unt; 0 def)
% Number of atoms : 113 ( 51 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 20 ~; 17 |; 2 &)
% ( 1 <=>; 4 =>; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 134 ( 5 sgn; 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',additive_commutativity) ).
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.6rzpX9CrPs/E---3.1_30636.p',star_induction_right) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',right_annihilation) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',additive_idempotence) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',star_unfold_right) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',left_annihilation) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',multiplicative_left_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',additive_associativity) ).
fof(goals,conjecture,
! [X4,X5] :
( leq(X4,X5)
=> leq(star(X4),star(X5)) ),
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',goals) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.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/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',multiplicative_right_identity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.6rzpX9CrPs/E---3.1_30636.p',multiplicative_associativity) ).
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.6rzpX9CrPs/E---3.1_30636.p',left_distributivity) ).
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.6rzpX9CrPs/E---3.1_30636.p',star_induction_left) ).
fof(c_0_17,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_18,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_19,plain,
! [X33,X34,X35] :
( ~ leq(addition(multiplication(X33,X34),X35),X33)
| leq(multiplication(X35,star(X34)),X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
fof(c_0_20,plain,
! [X24] : multiplication(X24,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_21,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X26,X27] :
( ( ~ leq(X26,X27)
| addition(X26,X27) = X27 )
& ( addition(X26,X27) != X27
| leq(X26,X27) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_24,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_25,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X28] : leq(addition(one,multiplication(X28,star(X28))),star(X28)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_31,plain,
! [X25] : multiplication(zero,X25) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_32,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_33,plain,
( leq(multiplication(X1,star(zero)),X2)
| ~ leq(X1,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_34,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
leq(multiplication(X1,star(zero)),X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_40,plain,
leq(one,star(zero)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_21]) ).
fof(c_0_41,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_42,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_43,plain,
leq(star(zero),one),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_44,plain,
addition(one,star(zero)) = star(zero),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_46,negated_conjecture,
~ ! [X4,X5] :
( leq(X4,X5)
=> leq(star(X4),star(X5)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_47,plain,
( leq(multiplication(X1,star(X1)),one)
| ~ leq(X1,one) ),
inference(spm,[status(thm)],[c_0_42,c_0_29]) ).
cnf(c_0_48,plain,
star(zero) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_43]),c_0_22]),c_0_44]) ).
cnf(c_0_49,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_50,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_39,c_0_35]),c_0_45]),c_0_22]) ).
fof(c_0_51,plain,
! [X29] : leq(addition(one,multiplication(star(X29),X29)),star(X29)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
fof(c_0_52,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_53,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_54,negated_conjecture,
( leq(esk1_0,esk2_0)
& ~ leq(star(esk1_0),star(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])]) ).
cnf(c_0_55,plain,
leq(star(one),one),
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_47,c_0_38]),c_0_37]),c_0_48]),c_0_37]),c_0_48]),c_0_37]) ).
cnf(c_0_56,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
fof(c_0_60,plain,
! [X13,X14,X15] : multiplication(X13,multiplication(X14,X15)) = multiplication(multiplication(X13,X14),X15),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_61,negated_conjecture,
leq(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_62,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_55]),c_0_22]),c_0_56]) ).
cnf(c_0_63,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_49]) ).
cnf(c_0_64,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_39,c_0_57]),c_0_45]),c_0_22]) ).
cnf(c_0_65,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_22]) ).
cnf(c_0_66,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_67,negated_conjecture,
leq(multiplication(esk1_0,star(zero)),esk2_0),
inference(spm,[status(thm)],[c_0_33,c_0_61]) ).
cnf(c_0_68,plain,
( leq(X1,X2)
| ~ leq(addition(X2,X1),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_59]),c_0_62]),c_0_59]) ).
cnf(c_0_69,plain,
leq(X1,addition(X2,X1)),
inference(spm,[status(thm)],[c_0_63,c_0_22]) ).
cnf(c_0_70,plain,
addition(one,multiplication(star(X1),addition(X1,one))) = star(X1),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
fof(c_0_71,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_72,plain,
( leq(multiplication(X1,multiplication(X2,star(X3))),X1)
| ~ leq(multiplication(X1,addition(X3,X2)),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_58]),c_0_66]) ).
cnf(c_0_73,negated_conjecture,
addition(esk2_0,multiplication(esk1_0,star(zero))) = esk2_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_67]),c_0_22]) ).
cnf(c_0_74,plain,
( leq(multiplication(X1,X2),X1)
| ~ leq(multiplication(X1,addition(X2,one)),X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_65]) ).
cnf(c_0_75,plain,
leq(multiplication(star(X1),addition(X1,one)),star(X1)),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( leq(multiplication(X1,multiplication(esk1_0,star(esk2_0))),X1)
| ~ leq(multiplication(X1,esk2_0),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_48]),c_0_59]) ).
cnf(c_0_78,plain,
leq(multiplication(star(X1),X1),star(X1)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
fof(c_0_79,plain,
! [X30,X31,X32] :
( ~ leq(addition(multiplication(X30,X31),X32),X31)
| leq(multiplication(star(X30),X32),X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])]) ).
cnf(c_0_80,plain,
( leq(multiplication(X1,X2),multiplication(X3,X2))
| multiplication(addition(X1,X3),X2) != multiplication(X3,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_76]) ).
cnf(c_0_81,negated_conjecture,
leq(multiplication(star(esk2_0),multiplication(esk1_0,star(esk2_0))),star(esk2_0)),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_83,plain,
leq(X1,multiplication(star(X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_56]),c_0_37]) ).
cnf(c_0_84,negated_conjecture,
multiplication(star(esk2_0),addition(one,multiplication(esk1_0,star(esk2_0)))) = star(esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_81]),c_0_22]),c_0_65]),c_0_22]) ).
cnf(c_0_85,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(X2,multiplication(X1,X3)),X3) ),
inference(spm,[status(thm)],[c_0_82,c_0_22]) ).
cnf(c_0_86,negated_conjecture,
leq(addition(one,multiplication(esk1_0,star(esk2_0))),star(esk2_0)),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_87,negated_conjecture,
~ leq(star(esk1_0),star(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_59]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KLE041+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 05:02:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.6rzpX9CrPs/E---3.1_30636.p
% 0.21/0.63 # Version: 3.1pre001
% 0.21/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.63 # Starting sh5l with 300s (1) cores
% 0.21/0.63 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30714 completed with status 0
% 0.21/0.63 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.63 # No SInE strategy applied
% 0.21/0.63 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.21/0.63 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.63 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.63 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.21/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.21/0.63 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.21/0.63 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 30721 completed with status 0
% 0.21/0.63 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.63 # No SInE strategy applied
% 0.21/0.63 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.21/0.63 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.63 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.63 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.21/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.21/0.63 # Preprocessing time : 0.001 s
% 0.21/0.63 # Presaturation interreduction done
% 0.21/0.63
% 0.21/0.63 # Proof found!
% 0.21/0.63 # SZS status Theorem
% 0.21/0.63 # SZS output start CNFRefutation
% See solution above
% 0.21/0.63 # Parsed axioms : 17
% 0.21/0.63 # Removed by relevancy pruning/SinE : 0
% 0.21/0.63 # Initial clauses : 19
% 0.21/0.63 # Removed in clause preprocessing : 0
% 0.21/0.63 # Initial clauses in saturation : 19
% 0.21/0.63 # Processed clauses : 1655
% 0.21/0.63 # ...of these trivial : 160
% 0.21/0.63 # ...subsumed : 1108
% 0.21/0.63 # ...remaining for further processing : 387
% 0.21/0.63 # Other redundant clauses eliminated : 24
% 0.21/0.63 # Clauses deleted for lack of memory : 0
% 0.21/0.63 # Backward-subsumed : 10
% 0.21/0.63 # Backward-rewritten : 24
% 0.21/0.63 # Generated clauses : 7313
% 0.21/0.63 # ...of the previous two non-redundant : 5255
% 0.21/0.63 # ...aggressively subsumed : 0
% 0.21/0.63 # Contextual simplify-reflections : 0
% 0.21/0.63 # Paramodulations : 7289
% 0.21/0.63 # Factorizations : 0
% 0.21/0.63 # NegExts : 0
% 0.21/0.63 # Equation resolutions : 24
% 0.21/0.63 # Total rewrite steps : 7177
% 0.21/0.63 # Propositional unsat checks : 0
% 0.21/0.63 # Propositional check models : 0
% 0.21/0.63 # Propositional check unsatisfiable : 0
% 0.21/0.63 # Propositional clauses : 0
% 0.21/0.63 # Propositional clauses after purity: 0
% 0.21/0.63 # Propositional unsat core size : 0
% 0.21/0.63 # Propositional preprocessing time : 0.000
% 0.21/0.63 # Propositional encoding time : 0.000
% 0.21/0.63 # Propositional solver time : 0.000
% 0.21/0.63 # Success case prop preproc time : 0.000
% 0.21/0.63 # Success case prop encoding time : 0.000
% 0.21/0.63 # Success case prop solver time : 0.000
% 0.21/0.63 # Current number of processed clauses : 334
% 0.21/0.63 # Positive orientable unit clauses : 130
% 0.21/0.63 # Positive unorientable unit clauses: 4
% 0.21/0.63 # Negative unit clauses : 1
% 0.21/0.63 # Non-unit-clauses : 199
% 0.21/0.63 # Current number of unprocessed clauses: 3571
% 0.21/0.63 # ...number of literals in the above : 6211
% 0.21/0.63 # Current number of archived formulas : 0
% 0.21/0.63 # Current number of archived clauses : 53
% 0.21/0.63 # Clause-clause subsumption calls (NU) : 12136
% 0.21/0.63 # Rec. Clause-clause subsumption calls : 12124
% 0.21/0.63 # Non-unit clause-clause subsumptions : 1052
% 0.21/0.63 # Unit Clause-clause subsumption calls : 436
% 0.21/0.63 # Rewrite failures with RHS unbound : 0
% 0.21/0.63 # BW rewrite match attempts : 304
% 0.21/0.63 # BW rewrite match successes : 98
% 0.21/0.63 # Condensation attempts : 0
% 0.21/0.63 # Condensation successes : 0
% 0.21/0.63 # Termbank termtop insertions : 77255
% 0.21/0.63
% 0.21/0.63 # -------------------------------------------------
% 0.21/0.63 # User time : 0.104 s
% 0.21/0.63 # System time : 0.005 s
% 0.21/0.63 # Total time : 0.109 s
% 0.21/0.63 # Maximum resident set size: 1732 pages
% 0.21/0.63
% 0.21/0.63 # -------------------------------------------------
% 0.21/0.63 # User time : 0.542 s
% 0.21/0.63 # System time : 0.028 s
% 0.21/0.63 # Total time : 0.570 s
% 0.21/0.63 # Maximum resident set size: 1688 pages
% 0.21/0.63 % E---3.1 exiting
% 0.21/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------