TSTP Solution File: KLE045+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE045+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 5.28s 1.12s
% Output : CNFRefutation 5.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 83 ( 68 unt; 0 def)
% Number of atoms : 100 ( 49 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 14 ~; 11 |; 2 &)
% ( 1 <=>; 3 =>; 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 : 137 ( 10 sgn; 54 !; 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.jY5W2EE8KN/E---3.1_25961.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',additive_idempotence) ).
fof(goals,conjecture,
! [X4,X5,X6] :
( leq(multiplication(X4,X6),multiplication(X6,X5))
=> leq(multiplication(star(X4),X6),multiplication(X6,star(X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',goals) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',order) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',additive_commutativity) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',star_unfold_right) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',star_unfold_left) ).
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.jY5W2EE8KN/E---3.1_25961.p',left_distributivity) ).
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.jY5W2EE8KN/E---3.1_25961.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',multiplicative_right_identity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',multiplicative_left_identity) ).
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.jY5W2EE8KN/E---3.1_25961.p',star_induction_left) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.jY5W2EE8KN/E---3.1_25961.p',multiplicative_associativity) ).
fof(c_0_13,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_14,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_15,negated_conjecture,
~ ! [X4,X5,X6] :
( leq(multiplication(X4,X6),multiplication(X6,X5))
=> leq(multiplication(star(X4),X6),multiplication(X6,star(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_16,plain,
! [X27,X28] :
( ( ~ leq(X27,X28)
| addition(X27,X28) = X28 )
& ( addition(X27,X28) != X28
| leq(X27,X28) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_17,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_20,negated_conjecture,
( leq(multiplication(esk1_0,esk3_0),multiplication(esk3_0,esk2_0))
& ~ leq(multiplication(star(esk1_0),esk3_0),multiplication(esk3_0,star(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_21,plain,
! [X29] : leq(addition(one,multiplication(X29,star(X29))),star(X29)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
cnf(c_0_22,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,plain,
! [X30] : leq(addition(one,multiplication(star(X30),X30)),star(X30)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
cnf(c_0_26,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
leq(multiplication(esk1_0,esk3_0),multiplication(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_28,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_29,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_32,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_34,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_35,negated_conjecture,
addition(multiplication(esk1_0,esk3_0),multiplication(esk3_0,esk2_0)) = multiplication(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,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_26,c_0_29]),c_0_17]),c_0_24]) ).
fof(c_0_38,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_39,plain,
leq(X1,addition(X2,addition(X3,X1))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,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_26,c_0_32]),c_0_17]),c_0_24]) ).
cnf(c_0_41,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),multiplication(esk1_0,esk3_0)) = multiplication(esk3_0,esk2_0),
inference(rw,[status(thm)],[c_0_35,c_0_24]) ).
cnf(c_0_44,plain,
( leq(multiplication(X1,X2),multiplication(X3,X2))
| multiplication(addition(X1,X3),X2) != multiplication(X3,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_45,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
cnf(c_0_46,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,plain,
leq(multiplication(star(X1),X1),star(X1)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_24]) ).
cnf(c_0_49,plain,
leq(X1,addition(X2,addition(X1,X3))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_50,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk1_0,esk3_0),X1)) = addition(multiplication(esk3_0,esk2_0),X1),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_51,plain,
leq(X1,multiplication(star(X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_52,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_47]),c_0_24]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
leq(multiplication(esk1_0,esk3_0),addition(multiplication(esk3_0,esk2_0),X1)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
leq(addition(X1,one),star(X1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
fof(c_0_55,plain,
! [X31,X32,X33] :
( ~ leq(addition(multiplication(X31,X32),X33),X32)
| leq(multiplication(star(X31),X33),X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])]) ).
cnf(c_0_56,negated_conjecture,
leq(multiplication(esk1_0,esk3_0),multiplication(esk3_0,addition(esk2_0,X1))),
inference(spm,[status(thm)],[c_0_53,c_0_41]) ).
cnf(c_0_57,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_54]),c_0_17]),c_0_45]) ).
cnf(c_0_58,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,plain,
leq(multiplication(X1,star(X1)),star(X1)),
inference(spm,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_60,negated_conjecture,
leq(multiplication(esk1_0,esk3_0),multiplication(esk3_0,star(esk2_0))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
fof(c_0_61,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_62,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(X2,multiplication(X1,X3)),X3) ),
inference(spm,[status(thm)],[c_0_58,c_0_24]) ).
cnf(c_0_63,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_59]),c_0_24]) ).
cnf(c_0_64,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_65,negated_conjecture,
addition(multiplication(esk1_0,esk3_0),multiplication(esk3_0,star(esk2_0))) = multiplication(esk3_0,star(esk2_0)),
inference(spm,[status(thm)],[c_0_26,c_0_60]) ).
cnf(c_0_66,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_67,plain,
leq(multiplication(star(X1),star(X1)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_68,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_24]) ).
cnf(c_0_69,negated_conjecture,
leq(multiplication(esk1_0,multiplication(esk3_0,X1)),multiplication(esk3_0,multiplication(star(esk2_0),X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_65]),c_0_66]),c_0_66]) ).
cnf(c_0_70,plain,
multiplication(star(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_26,c_0_67]),c_0_24]),c_0_48]),c_0_24]),c_0_45]) ).
cnf(c_0_71,plain,
( leq(multiplication(star(X1),X2),X2)
| ~ leq(multiplication(addition(X1,one),X2),X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
leq(multiplication(esk1_0,multiplication(esk3_0,star(esk2_0))),multiplication(esk3_0,star(esk2_0))),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
addition(multiplication(X1,multiplication(X2,X3)),multiplication(X4,X3)) = multiplication(addition(multiplication(X1,X2),X4),X3),
inference(spm,[status(thm)],[c_0_36,c_0_66]) ).
cnf(c_0_74,plain,
( leq(multiplication(X1,X2),multiplication(X1,X3))
| multiplication(X1,addition(X2,X3)) != multiplication(X1,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_75,plain,
( leq(multiplication(star(X1),X2),X2)
| ~ leq(multiplication(addition(one,X1),X2),X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_24]) ).
cnf(c_0_76,negated_conjecture,
multiplication(addition(one,esk1_0),multiplication(esk3_0,star(esk2_0))) = multiplication(esk3_0,star(esk2_0)),
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_26,c_0_72]),c_0_73]),c_0_24]),c_0_68]),c_0_24]),c_0_66]) ).
cnf(c_0_77,plain,
leq(X1,multiplication(X1,star(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_45]),c_0_42]) ).
cnf(c_0_78,negated_conjecture,
leq(multiplication(star(esk1_0),multiplication(esk3_0,star(esk2_0))),multiplication(esk3_0,star(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_64])]) ).
cnf(c_0_79,plain,
leq(multiplication(X1,X2),multiplication(X1,multiplication(X2,star(X3)))),
inference(spm,[status(thm)],[c_0_77,c_0_66]) ).
cnf(c_0_80,negated_conjecture,
multiplication(star(esk1_0),multiplication(esk3_0,star(esk2_0))) = multiplication(esk3_0,star(esk2_0)),
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_26,c_0_78]),c_0_73]),c_0_24]),c_0_68]),c_0_24]),c_0_45]),c_0_66]) ).
cnf(c_0_81,negated_conjecture,
~ leq(multiplication(star(esk1_0),esk3_0),multiplication(esk3_0,star(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE045+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 04:38:14 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.jY5W2EE8KN/E---3.1_25961.p
% 5.28/1.12 # Version: 3.1pre001
% 5.28/1.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.28/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.28/1.12 # Starting new_bool_3 with 300s (1) cores
% 5.28/1.12 # Starting new_bool_1 with 300s (1) cores
% 5.28/1.12 # Starting sh5l with 300s (1) cores
% 5.28/1.12 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26039 completed with status 0
% 5.28/1.12 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 5.28/1.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.28/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.28/1.12 # No SInE strategy applied
% 5.28/1.12 # Search class: FHUSM-FFSF21-MFFFFFNN
% 5.28/1.12 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 5.28/1.12 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.28/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.28/1.12 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 5.28/1.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 5.28/1.12 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 5.28/1.12 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 26047 completed with status 0
% 5.28/1.12 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 5.28/1.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.28/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.28/1.12 # No SInE strategy applied
% 5.28/1.12 # Search class: FHUSM-FFSF21-MFFFFFNN
% 5.28/1.12 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 5.28/1.12 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.28/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.28/1.12 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 5.28/1.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 5.28/1.12 # Preprocessing time : 0.001 s
% 5.28/1.12 # Presaturation interreduction done
% 5.28/1.12
% 5.28/1.12 # Proof found!
% 5.28/1.12 # SZS status Theorem
% 5.28/1.12 # SZS output start CNFRefutation
% See solution above
% 5.28/1.12 # Parsed axioms : 17
% 5.28/1.12 # Removed by relevancy pruning/SinE : 0
% 5.28/1.12 # Initial clauses : 19
% 5.28/1.12 # Removed in clause preprocessing : 0
% 5.28/1.12 # Initial clauses in saturation : 19
% 5.28/1.12 # Processed clauses : 5847
% 5.28/1.12 # ...of these trivial : 631
% 5.28/1.12 # ...subsumed : 3694
% 5.28/1.12 # ...remaining for further processing : 1522
% 5.28/1.12 # Other redundant clauses eliminated : 36
% 5.28/1.12 # Clauses deleted for lack of memory : 0
% 5.28/1.12 # Backward-subsumed : 7
% 5.28/1.12 # Backward-rewritten : 233
% 5.28/1.12 # Generated clauses : 51522
% 5.28/1.12 # ...of the previous two non-redundant : 40423
% 5.28/1.12 # ...aggressively subsumed : 0
% 5.28/1.12 # Contextual simplify-reflections : 0
% 5.28/1.12 # Paramodulations : 51486
% 5.28/1.12 # Factorizations : 0
% 5.28/1.12 # NegExts : 0
% 5.28/1.12 # Equation resolutions : 36
% 5.28/1.12 # Total rewrite steps : 50967
% 5.28/1.12 # Propositional unsat checks : 0
% 5.28/1.12 # Propositional check models : 0
% 5.28/1.12 # Propositional check unsatisfiable : 0
% 5.28/1.12 # Propositional clauses : 0
% 5.28/1.12 # Propositional clauses after purity: 0
% 5.28/1.12 # Propositional unsat core size : 0
% 5.28/1.12 # Propositional preprocessing time : 0.000
% 5.28/1.12 # Propositional encoding time : 0.000
% 5.28/1.12 # Propositional solver time : 0.000
% 5.28/1.12 # Success case prop preproc time : 0.000
% 5.28/1.12 # Success case prop encoding time : 0.000
% 5.28/1.12 # Success case prop solver time : 0.000
% 5.28/1.12 # Current number of processed clauses : 1263
% 5.28/1.12 # Positive orientable unit clauses : 541
% 5.28/1.12 # Positive unorientable unit clauses: 7
% 5.28/1.12 # Negative unit clauses : 1
% 5.28/1.12 # Non-unit-clauses : 714
% 5.28/1.12 # Current number of unprocessed clauses: 34007
% 5.28/1.12 # ...number of literals in the above : 59421
% 5.28/1.12 # Current number of archived formulas : 0
% 5.28/1.12 # Current number of archived clauses : 259
% 5.28/1.12 # Clause-clause subsumption calls (NU) : 85558
% 5.28/1.12 # Rec. Clause-clause subsumption calls : 85474
% 5.28/1.12 # Non-unit clause-clause subsumptions : 3635
% 5.28/1.12 # Unit Clause-clause subsumption calls : 16066
% 5.28/1.12 # Rewrite failures with RHS unbound : 0
% 5.28/1.12 # BW rewrite match attempts : 3319
% 5.28/1.12 # BW rewrite match successes : 155
% 5.28/1.12 # Condensation attempts : 0
% 5.28/1.12 # Condensation successes : 0
% 5.28/1.12 # Termbank termtop insertions : 920559
% 5.28/1.12
% 5.28/1.12 # -------------------------------------------------
% 5.28/1.12 # User time : 0.606 s
% 5.28/1.12 # System time : 0.017 s
% 5.28/1.12 # Total time : 0.623 s
% 5.28/1.12 # Maximum resident set size: 1732 pages
% 5.28/1.12
% 5.28/1.12 # -------------------------------------------------
% 5.28/1.12 # User time : 2.985 s
% 5.28/1.12 # System time : 0.104 s
% 5.28/1.12 # Total time : 3.090 s
% 5.28/1.12 # Maximum resident set size: 1684 pages
% 5.28/1.12 % E---3.1 exiting
% 5.28/1.13 % E---3.1 exiting
%------------------------------------------------------------------------------