TSTP Solution File: KLE145+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE145+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:05:16 EDT 2023
% Result : Theorem 53.90s 7.58s
% Output : CNFRefutation 53.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 84 ( 70 unt; 0 def)
% Number of atoms : 100 ( 65 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 15 ~; 12 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 139 ( 3 sgn; 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',order) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',additive_commutativity) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',star_unfold2) ).
fof(star_induction2,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X3,X1),X2),X3)
=> leq(multiplication(X2,star(X1)),X3) ),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',star_induction2) ).
fof(star_unfold1,axiom,
! [X1] : addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',star_unfold1) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',distributivity2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',multiplicative_left_identity) ).
fof(distributivity1,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',distributivity1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',multiplicative_right_identity) ).
fof(infty_coinduction,axiom,
! [X1,X2,X3] :
( leq(X3,addition(multiplication(X1,X3),X2))
=> leq(X3,multiplication(strong_iteration(X1),X2)) ),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',infty_coinduction) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',multiplicative_associativity) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',infty_unfold1) ).
fof(goals,conjecture,
! [X4] : star(strong_iteration(X4)) = strong_iteration(X4),
file('/export/starexec/sandbox/tmp/tmp.VrEmxBrAyM/E---3.1_12050.p',goals) ).
fof(c_0_15,plain,
! [X7,X8,X9] : addition(X9,addition(X8,X7)) = addition(addition(X9,X8),X7),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_16,plain,
! [X11] : addition(X11,X11) = X11,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_17,plain,
! [X37,X38] :
( ( ~ leq(X37,X38)
| addition(X37,X38) = X38 )
& ( addition(X37,X38) != X38
| leq(X37,X38) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_18,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_22,plain,
! [X5,X6] : addition(X5,X6) = addition(X6,X5),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_23,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X25] : addition(one,multiplication(star(X25),X25)) = star(X25),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
fof(c_0_26,plain,
! [X29,X30,X31] :
( ~ leq(addition(multiplication(X31,X29),X30),X31)
| leq(multiplication(X30,star(X29)),X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
cnf(c_0_27,plain,
leq(X1,addition(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_29,plain,
! [X24] : addition(one,multiplication(X24,star(X24))) = star(X24),
inference(variable_rename,[status(thm)],[star_unfold1]) ).
cnf(c_0_30,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_32,plain,
leq(multiplication(star(X1),X1),star(X1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_34,plain,
! [X20,X21,X22] : multiplication(addition(X20,X21),X22) = addition(multiplication(X20,X22),multiplication(X21,X22)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
fof(c_0_35,plain,
! [X16] : multiplication(one,X16) = X16,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_36,plain,
! [X17,X18,X19] : multiplication(X17,addition(X18,X19)) = addition(multiplication(X17,X18),multiplication(X17,X19)),
inference(variable_rename,[status(thm)],[distributivity1]) ).
fof(c_0_37,plain,
! [X15] : multiplication(X15,one) = X15,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_38,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_39,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]) ).
cnf(c_0_40,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_41,plain,
leq(multiplication(X1,star(X1)),star(X1)),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_42,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,plain,
leq(multiplication(star(X1),star(X1)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
fof(c_0_47,plain,
! [X33,X34,X35] :
( ~ leq(X35,addition(multiplication(X33,X35),X34))
| leq(X35,multiplication(strong_iteration(X33),X34)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])]) ).
fof(c_0_48,plain,
! [X12,X13,X14] : multiplication(X12,multiplication(X13,X14)) = multiplication(multiplication(X12,X13),X14),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_49,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_41]),c_0_24]) ).
cnf(c_0_50,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24]) ).
fof(c_0_51,plain,
! [X32] : strong_iteration(X32) = addition(multiplication(X32,strong_iteration(X32)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
cnf(c_0_52,plain,
( leq(multiplication(X1,X2),multiplication(X3,X2))
| multiplication(addition(X1,X3),X2) != multiplication(X3,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_42]) ).
cnf(c_0_53,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_54,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_24]) ).
cnf(c_0_55,plain,
addition(star(X1),multiplication(star(X1),star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_46]),c_0_24]) ).
cnf(c_0_56,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_58,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_59,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,plain,
leq(X1,multiplication(star(X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_43]) ).
cnf(c_0_61,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[c_0_39,c_0_54]) ).
cnf(c_0_62,plain,
leq(multiplication(star(X1),star(star(X1))),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_55]),c_0_40])]) ).
cnf(c_0_63,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(X3,multiplication(X2,X1))) ),
inference(spm,[status(thm)],[c_0_56,c_0_24]) ).
cnf(c_0_64,plain,
addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2))))) = star(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_57]) ).
cnf(c_0_65,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_58,c_0_24]) ).
cnf(c_0_66,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_59,c_0_24]) ).
cnf(c_0_67,plain,
leq(addition(X1,one),star(X1)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_68,plain,
addition(star(X1),multiplication(star(X1),star(star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_62]),c_0_24]) ).
cnf(c_0_69,plain,
( leq(multiplication(X1,star(multiplication(X2,X1))),strong_iteration(X2))
| ~ leq(multiplication(X1,star(multiplication(X2,X1))),star(multiplication(X2,X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_45]) ).
cnf(c_0_70,plain,
multiplication(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1)))) = star(multiplication(X1,strong_iteration(X1))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,plain,
addition(one,addition(multiplication(X1,strong_iteration(X1)),X2)) = addition(strong_iteration(X1),X2),
inference(spm,[status(thm)],[c_0_18,c_0_66]) ).
cnf(c_0_72,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_67]),c_0_18]),c_0_53]) ).
fof(c_0_73,negated_conjecture,
~ ! [X4] : star(strong_iteration(X4)) = strong_iteration(X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_74,plain,
multiplication(star(X1),star(star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_54]),c_0_24]),c_0_53]) ).
cnf(c_0_75,plain,
multiplication(star(X1),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_54]),c_0_24]),c_0_53]) ).
cnf(c_0_76,plain,
leq(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_40])]) ).
cnf(c_0_77,plain,
addition(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1)))) = star(multiplication(X1,strong_iteration(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_53]) ).
fof(c_0_78,negated_conjecture,
star(strong_iteration(esk1_0)) != strong_iteration(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])]) ).
cnf(c_0_79,plain,
star(star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_74]),c_0_75]),c_0_74]),c_0_53]) ).
cnf(c_0_80,plain,
star(multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_76]),c_0_24]),c_0_77]) ).
cnf(c_0_81,negated_conjecture,
star(strong_iteration(esk1_0)) != strong_iteration(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_82,plain,
star(strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : KLE145+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.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 05:02:29 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.VrEmxBrAyM/E---3.1_12050.p
% 53.90/7.58 # Version: 3.1pre001
% 53.90/7.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 53.90/7.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.90/7.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 53.90/7.58 # Starting new_bool_3 with 300s (1) cores
% 53.90/7.58 # Starting new_bool_1 with 300s (1) cores
% 53.90/7.58 # Starting sh5l with 300s (1) cores
% 53.90/7.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12127 completed with status 0
% 53.90/7.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 53.90/7.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 53.90/7.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.90/7.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 53.90/7.58 # No SInE strategy applied
% 53.90/7.58 # Search class: FHUSM-FFSF21-MFFFFFNN
% 53.90/7.58 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 53.90/7.58 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 53.90/7.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 53.90/7.58 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 53.90/7.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 53.90/7.58 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 53.90/7.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 12137 completed with status 0
% 53.90/7.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 53.90/7.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 53.90/7.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.90/7.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 53.90/7.58 # No SInE strategy applied
% 53.90/7.58 # Search class: FHUSM-FFSF21-MFFFFFNN
% 53.90/7.58 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 53.90/7.58 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 53.90/7.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 53.90/7.58 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 53.90/7.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 53.90/7.58 # Preprocessing time : 0.001 s
% 53.90/7.58 # Presaturation interreduction done
% 53.90/7.58
% 53.90/7.58 # Proof found!
% 53.90/7.58 # SZS status Theorem
% 53.90/7.58 # SZS output start CNFRefutation
% See solution above
% 53.90/7.58 # Parsed axioms : 19
% 53.90/7.58 # Removed by relevancy pruning/SinE : 0
% 53.90/7.58 # Initial clauses : 20
% 53.90/7.58 # Removed in clause preprocessing : 0
% 53.90/7.58 # Initial clauses in saturation : 20
% 53.90/7.58 # Processed clauses : 26229
% 53.90/7.58 # ...of these trivial : 2872
% 53.90/7.58 # ...subsumed : 20542
% 53.90/7.58 # ...remaining for further processing : 2815
% 53.90/7.58 # Other redundant clauses eliminated : 2013
% 53.90/7.58 # Clauses deleted for lack of memory : 0
% 53.90/7.58 # Backward-subsumed : 32
% 53.90/7.58 # Backward-rewritten : 593
% 53.90/7.58 # Generated clauses : 548556
% 53.90/7.58 # ...of the previous two non-redundant : 378402
% 53.90/7.58 # ...aggressively subsumed : 0
% 53.90/7.58 # Contextual simplify-reflections : 0
% 53.90/7.58 # Paramodulations : 546540
% 53.90/7.58 # Factorizations : 0
% 53.90/7.58 # NegExts : 0
% 53.90/7.58 # Equation resolutions : 2016
% 53.90/7.58 # Total rewrite steps : 934205
% 53.90/7.58 # Propositional unsat checks : 0
% 53.90/7.58 # Propositional check models : 0
% 53.90/7.58 # Propositional check unsatisfiable : 0
% 53.90/7.58 # Propositional clauses : 0
% 53.90/7.58 # Propositional clauses after purity: 0
% 53.90/7.58 # Propositional unsat core size : 0
% 53.90/7.58 # Propositional preprocessing time : 0.000
% 53.90/7.58 # Propositional encoding time : 0.000
% 53.90/7.58 # Propositional solver time : 0.000
% 53.90/7.58 # Success case prop preproc time : 0.000
% 53.90/7.58 # Success case prop encoding time : 0.000
% 53.90/7.58 # Success case prop solver time : 0.000
% 53.90/7.58 # Current number of processed clauses : 2159
% 53.90/7.58 # Positive orientable unit clauses : 872
% 53.90/7.58 # Positive unorientable unit clauses: 18
% 53.90/7.58 # Negative unit clauses : 0
% 53.90/7.58 # Non-unit-clauses : 1269
% 53.90/7.58 # Current number of unprocessed clauses: 349191
% 53.90/7.58 # ...number of literals in the above : 601668
% 53.90/7.58 # Current number of archived formulas : 0
% 53.90/7.58 # Current number of archived clauses : 645
% 53.90/7.58 # Clause-clause subsumption calls (NU) : 302750
% 53.90/7.58 # Rec. Clause-clause subsumption calls : 302513
% 53.90/7.58 # Non-unit clause-clause subsumptions : 20158
% 53.90/7.58 # Unit Clause-clause subsumption calls : 9237
% 53.90/7.58 # Rewrite failures with RHS unbound : 0
% 53.90/7.58 # BW rewrite match attempts : 8476
% 53.90/7.58 # BW rewrite match successes : 419
% 53.90/7.58 # Condensation attempts : 0
% 53.90/7.58 # Condensation successes : 0
% 53.90/7.58 # Termbank termtop insertions : 8676606
% 53.90/7.58
% 53.90/7.58 # -------------------------------------------------
% 53.90/7.58 # User time : 6.047 s
% 53.90/7.58 # System time : 0.235 s
% 53.90/7.58 # Total time : 6.282 s
% 53.90/7.58 # Maximum resident set size: 1740 pages
% 53.90/7.58
% 53.90/7.58 # -------------------------------------------------
% 53.90/7.58 # User time : 31.699 s
% 53.90/7.58 # System time : 1.251 s
% 53.90/7.58 # Total time : 32.950 s
% 53.90/7.58 # Maximum resident set size: 1688 pages
% 53.90/7.58 % E---3.1 exiting
%------------------------------------------------------------------------------