TSTP Solution File: KLE135+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE135+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:26 EDT 2023
% Result : Theorem 148.36s 19.34s
% Output : CNFRefutation 148.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 79 ( 72 unt; 0 def)
% Number of atoms : 86 ( 85 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 3 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 16 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 123 ( 6 sgn; 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',additive_commutativity) ).
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.JHneURepnF/E---3.1_7263.p',left_distributivity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',domain1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',additive_identity) ).
fof(forward_diamond,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',forward_diamond) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',domain4) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',additive_idempotence) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',left_annihilation) ).
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.JHneURepnF/E---3.1_7263.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',multiplicative_right_identity) ).
fof(divergence2,axiom,
! [X4,X5,X6] :
( addition(domain(X4),addition(forward_diamond(X5,domain(X4)),domain(X6))) = addition(forward_diamond(X5,domain(X4)),domain(X6))
=> addition(domain(X4),addition(divergence(X5),forward_diamond(star(X5),domain(X6)))) = addition(divergence(X5),forward_diamond(star(X5),domain(X6))) ),
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',divergence2) ).
fof(divergence1,axiom,
! [X4] : forward_diamond(X4,divergence(X4)) = divergence(X4),
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',divergence1) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',multiplicative_left_identity) ).
fof(goals,conjecture,
! [X4] :
( divergence(X4) = zero
=> forward_diamond(star(X4),antidomain(X4)) = one ),
file('/export/starexec/sandbox/tmp/tmp.JHneURepnF/E---3.1_7263.p',goals) ).
fof(c_0_17,plain,
! [X32] : addition(antidomain(antidomain(X32)),antidomain(X32)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_18,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_19,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_20,plain,
! [X29] : multiplication(antidomain(X29),X29) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_21,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_22,plain,
! [X42,X43] : forward_diamond(X42,X43) = domain(multiplication(X42,domain(X43))),
inference(variable_rename,[status(thm)],[forward_diamond]) ).
fof(c_0_23,plain,
! [X33] : domain(X33) = antidomain(antidomain(X33)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_24,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_25,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_26,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_27,plain,
! [X26] : multiplication(zero,X26) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_28,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_30,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_31,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_32,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_34,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_35,plain,
! [X51,X52,X53] :
( addition(domain(X51),addition(forward_diamond(X52,domain(X51)),domain(X53))) != addition(forward_diamond(X52,domain(X51)),domain(X53))
| addition(domain(X51),addition(divergence(X52),forward_diamond(star(X52),domain(X53)))) = addition(divergence(X52),forward_diamond(star(X52),domain(X53))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[divergence2])]) ).
cnf(c_0_36,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_37,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_39,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_40,plain,
! [X50] : forward_diamond(X50,divergence(X50)) = divergence(X50),
inference(variable_rename,[status(thm)],[divergence1]) ).
cnf(c_0_41,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_43,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_44,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_45,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_46,plain,
multiplication(addition(X1,antidomain(X2)),X2) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
fof(c_0_47,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_48,negated_conjecture,
~ ! [X4] :
( divergence(X4) = zero
=> forward_diamond(star(X4),antidomain(X4)) = one ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_49,plain,
( addition(domain(X1),addition(divergence(X2),forward_diamond(star(X2),domain(X3)))) = addition(divergence(X2),forward_diamond(star(X2),domain(X3)))
| addition(domain(X1),addition(forward_diamond(X2,domain(X1)),domain(X3))) != addition(forward_diamond(X2,domain(X1)),domain(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_50,plain,
forward_diamond(X1,X2) = antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_51,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_52,plain,
forward_diamond(X1,divergence(X1)) = divergence(X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_53,plain,
multiplication(antidomain(X1),multiplication(X1,X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_42]) ).
cnf(c_0_54,plain,
addition(antidomain(X1),addition(antidomain(antidomain(X1)),X2)) = addition(one,X2),
inference(spm,[status(thm)],[c_0_38,c_0_43]) ).
cnf(c_0_55,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_29]) ).
cnf(c_0_56,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(spm,[status(thm)],[c_0_46,c_0_29]) ).
cnf(c_0_57,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_58,negated_conjecture,
( divergence(esk1_0) = zero
& forward_diamond(star(esk1_0),antidomain(esk1_0)) != one ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])]) ).
cnf(c_0_59,plain,
( addition(antidomain(antidomain(X1)),addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3))))))))) = addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3))))))))
| addition(antidomain(antidomain(X1)),addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3)))) != addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3))) ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_50]),c_0_50]),c_0_50]),c_0_50]) ).
cnf(c_0_60,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_43]),c_0_29]) ).
cnf(c_0_61,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_45,c_0_33]) ).
cnf(c_0_62,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_63,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_38]) ).
cnf(c_0_64,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1)))))) = divergence(X1),
inference(rw,[status(thm)],[c_0_52,c_0_50]) ).
cnf(c_0_65,plain,
multiplication(antidomain(X1),addition(X2,multiplication(X1,X3))) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_53]),c_0_34]) ).
cnf(c_0_66,plain,
addition(antidomain(X1),multiplication(antidomain(antidomain(X1)),addition(X2,one))) = addition(one,multiplication(antidomain(antidomain(X1)),X2)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_67,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_43]),c_0_57]) ).
cnf(c_0_68,negated_conjecture,
forward_diamond(star(esk1_0),antidomain(esk1_0)) != one,
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_69,plain,
addition(antidomain(antidomain(X1)),addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))))))))))) = addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1)))))))))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_43]),c_0_29]),c_0_60])]) ).
cnf(c_0_70,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_61]),c_0_62]) ).
cnf(c_0_71,plain,
addition(one,addition(X1,antidomain(X2))) = addition(X1,one),
inference(spm,[status(thm)],[c_0_63,c_0_60]) ).
cnf(c_0_72,plain,
addition(one,divergence(X1)) = one,
inference(spm,[status(thm)],[c_0_60,c_0_64]) ).
cnf(c_0_73,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_65]),c_0_45]),c_0_67]) ).
cnf(c_0_74,negated_conjecture,
antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(antidomain(esk1_0)))))) != one,
inference(rw,[status(thm)],[c_0_68,c_0_50]) ).
cnf(c_0_75,plain,
addition(divergence(X1),antidomain(antidomain(multiplication(star(X1),antidomain(X1))))) = one,
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(rw,[status(thm)],[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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_61]),c_0_70]),c_0_70]),c_0_61]),c_0_70]),c_0_45]),c_0_71]),c_0_29]),c_0_72]),c_0_70]),c_0_61]),c_0_70]),c_0_45]),c_0_73]),c_0_73]) ).
cnf(c_0_76,negated_conjecture,
divergence(esk1_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_77,negated_conjecture,
antidomain(antidomain(multiplication(star(esk1_0),antidomain(esk1_0)))) != one,
inference(spm,[status(thm)],[c_0_74,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_62]),c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE135+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n023.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 05:00:22 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.JHneURepnF/E---3.1_7263.p
% 148.36/19.34 # Version: 3.1pre001
% 148.36/19.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 148.36/19.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 148.36/19.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 148.36/19.34 # Starting new_bool_3 with 300s (1) cores
% 148.36/19.34 # Starting new_bool_1 with 300s (1) cores
% 148.36/19.34 # Starting sh5l with 300s (1) cores
% 148.36/19.34 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7342 completed with status 0
% 148.36/19.34 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 148.36/19.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 148.36/19.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 148.36/19.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 148.36/19.34 # No SInE strategy applied
% 148.36/19.34 # Search class: FHUSM-FFMF21-DFFFFFNN
% 148.36/19.34 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 148.36/19.34 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 148.36/19.34 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 797s (1) cores
% 148.36/19.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 148.36/19.34 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 148.36/19.34 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 148.36/19.34 # Starting G-E--_200_C18_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 148.36/19.34 # G-E--_200_C18_F1_AE_CS_SP_PI_S0Y with pid 7350 completed with status 0
% 148.36/19.34 # Result found by G-E--_200_C18_F1_AE_CS_SP_PI_S0Y
% 148.36/19.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 148.36/19.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 148.36/19.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 148.36/19.34 # No SInE strategy applied
% 148.36/19.34 # Search class: FHUSM-FFMF21-DFFFFFNN
% 148.36/19.34 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 148.36/19.34 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 148.36/19.34 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 797s (1) cores
% 148.36/19.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 148.36/19.34 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 148.36/19.34 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 148.36/19.34 # Starting G-E--_200_C18_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 148.36/19.34 # Preprocessing time : 0.001 s
% 148.36/19.34
% 148.36/19.34 # Proof found!
% 148.36/19.34 # SZS status Theorem
% 148.36/19.34 # SZS output start CNFRefutation
% See solution above
% 148.36/19.34 # Parsed axioms : 29
% 148.36/19.34 # Removed by relevancy pruning/SinE : 0
% 148.36/19.34 # Initial clauses : 31
% 148.36/19.34 # Removed in clause preprocessing : 8
% 148.36/19.34 # Initial clauses in saturation : 23
% 148.36/19.34 # Processed clauses : 31509
% 148.36/19.34 # ...of these trivial : 2213
% 148.36/19.34 # ...subsumed : 26947
% 148.36/19.34 # ...remaining for further processing : 2349
% 148.36/19.34 # Other redundant clauses eliminated : 0
% 148.36/19.34 # Clauses deleted for lack of memory : 0
% 148.36/19.34 # Backward-subsumed : 78
% 148.36/19.34 # Backward-rewritten : 456
% 148.36/19.34 # Generated clauses : 1365874
% 148.36/19.34 # ...of the previous two non-redundant : 790409
% 148.36/19.34 # ...aggressively subsumed : 0
% 148.36/19.34 # Contextual simplify-reflections : 3
% 148.36/19.34 # Paramodulations : 1365874
% 148.36/19.34 # Factorizations : 0
% 148.36/19.34 # NegExts : 0
% 148.36/19.34 # Equation resolutions : 0
% 148.36/19.34 # Total rewrite steps : 4149108
% 148.36/19.34 # Propositional unsat checks : 0
% 148.36/19.34 # Propositional check models : 0
% 148.36/19.34 # Propositional check unsatisfiable : 0
% 148.36/19.34 # Propositional clauses : 0
% 148.36/19.34 # Propositional clauses after purity: 0
% 148.36/19.34 # Propositional unsat core size : 0
% 148.36/19.34 # Propositional preprocessing time : 0.000
% 148.36/19.34 # Propositional encoding time : 0.000
% 148.36/19.34 # Propositional solver time : 0.000
% 148.36/19.34 # Success case prop preproc time : 0.000
% 148.36/19.34 # Success case prop encoding time : 0.000
% 148.36/19.34 # Success case prop solver time : 0.000
% 148.36/19.34 # Current number of processed clauses : 1815
% 148.36/19.34 # Positive orientable unit clauses : 1338
% 148.36/19.34 # Positive unorientable unit clauses: 18
% 148.36/19.34 # Negative unit clauses : 57
% 148.36/19.34 # Non-unit-clauses : 402
% 148.36/19.34 # Current number of unprocessed clauses: 754576
% 148.36/19.34 # ...number of literals in the above : 935709
% 148.36/19.34 # Current number of archived formulas : 0
% 148.36/19.34 # Current number of archived clauses : 542
% 148.36/19.34 # Clause-clause subsumption calls (NU) : 206101
% 148.36/19.34 # Rec. Clause-clause subsumption calls : 135485
% 148.36/19.34 # Non-unit clause-clause subsumptions : 7660
% 148.36/19.34 # Unit Clause-clause subsumption calls : 4082
% 148.36/19.34 # Rewrite failures with RHS unbound : 0
% 148.36/19.34 # BW rewrite match attempts : 20488
% 148.36/19.34 # BW rewrite match successes : 346
% 148.36/19.34 # Condensation attempts : 0
% 148.36/19.34 # Condensation successes : 0
% 148.36/19.34 # Termbank termtop insertions : 33600439
% 148.36/19.34
% 148.36/19.34 # -------------------------------------------------
% 148.36/19.34 # User time : 17.778 s
% 148.36/19.34 # System time : 0.618 s
% 148.36/19.34 # Total time : 18.396 s
% 148.36/19.34 # Maximum resident set size: 1836 pages
% 148.36/19.34
% 148.36/19.34 # -------------------------------------------------
% 148.36/19.34 # User time : 89.082 s
% 148.36/19.34 # System time : 3.001 s
% 148.36/19.34 # Total time : 92.083 s
% 148.36/19.34 # Maximum resident set size: 1700 pages
% 148.36/19.34 % E---3.1 exiting
% 148.36/19.34 % E---3.1 exiting
%------------------------------------------------------------------------------