TSTP Solution File: KLE017+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE017+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:39 EDT 2023
% Result : Theorem 11.63s 1.97s
% Output : CNFRefutation 11.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 41 unt; 0 def)
% Number of atoms : 143 ( 80 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 107 ( 39 ~; 43 |; 18 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn; 48 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(X6,multiplication(X4,X5))
<=> ( leq(X6,X4)
& leq(X6,X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',goals) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',order) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',additive_idempotence) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',test_1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',additive_commutativity) ).
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.2lG5UuW9mj/E---3.1_21263.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',multiplicative_right_identity) ).
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.2lG5UuW9mj/E---3.1_21263.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',multiplicative_left_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p',additive_identity) ).
fof(c_0_12,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(X6,multiplication(X4,X5))
<=> ( leq(X6,X4)
& leq(X6,X5) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_13,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])]) ).
fof(c_0_14,negated_conjecture,
( test(esk2_0)
& test(esk3_0)
& test(esk4_0)
& ( ~ leq(esk4_0,multiplication(esk2_0,esk3_0))
| ~ leq(esk4_0,esk2_0)
| ~ leq(esk4_0,esk3_0) )
& ( leq(esk4_0,esk2_0)
| leq(esk4_0,multiplication(esk2_0,esk3_0)) )
& ( leq(esk4_0,esk3_0)
| leq(esk4_0,multiplication(esk2_0,esk3_0)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_15,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( leq(esk4_0,esk2_0)
| leq(esk4_0,multiplication(esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_18,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_19,plain,
! [X33,X34] :
( ( multiplication(X33,X34) = zero
| ~ complement(X34,X33) )
& ( multiplication(X34,X33) = zero
| ~ complement(X34,X33) )
& ( addition(X33,X34) = one
| ~ complement(X34,X33) )
& ( multiplication(X33,X34) != zero
| multiplication(X34,X33) != zero
| addition(X33,X34) != one
| complement(X34,X33) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
fof(c_0_20,plain,
! [X29,X31,X32] :
( ( ~ test(X29)
| complement(esk1_1(X29),X29) )
& ( ~ complement(X32,X31)
| test(X31) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])]) ).
cnf(c_0_21,negated_conjecture,
( addition(esk4_0,multiplication(esk2_0,esk3_0)) = multiplication(esk2_0,esk3_0)
| leq(esk4_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( addition(esk4_0,multiplication(esk2_0,esk3_0)) = multiplication(esk2_0,esk3_0)
| addition(esk4_0,esk2_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
fof(c_0_27,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_28,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_29,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_30,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( leq(esk4_0,esk3_0)
| leq(esk4_0,multiplication(esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,negated_conjecture,
( addition(esk4_0,addition(multiplication(esk2_0,esk3_0),X1)) = addition(multiplication(esk2_0,esk3_0),X1)
| addition(esk4_0,esk2_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_34,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,negated_conjecture,
( ~ leq(esk4_0,multiplication(esk2_0,esk3_0))
| ~ leq(esk4_0,esk2_0)
| ~ leq(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( addition(esk4_0,multiplication(esk2_0,esk3_0)) = multiplication(esk2_0,esk3_0)
| leq(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( addition(esk4_0,addition(X1,multiplication(esk2_0,esk3_0))) = addition(X1,multiplication(esk2_0,esk3_0))
| addition(esk4_0,esk2_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34]) ).
cnf(c_0_44,negated_conjecture,
addition(esk3_0,one) = one,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( addition(esk4_0,multiplication(esk2_0,esk3_0)) != multiplication(esk2_0,esk3_0)
| ~ leq(esk4_0,esk2_0)
| ~ leq(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( addition(esk4_0,multiplication(esk2_0,esk3_0)) = multiplication(esk2_0,esk3_0)
| addition(esk4_0,esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_41]) ).
fof(c_0_47,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_48,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_49,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_50,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_51,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_34]),c_0_22]) ).
cnf(c_0_52,negated_conjecture,
addition(esk4_0,esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_36]),c_0_44]),c_0_36])]) ).
cnf(c_0_53,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,negated_conjecture,
( addition(esk4_0,multiplication(esk2_0,esk3_0)) != multiplication(esk2_0,esk3_0)
| addition(esk4_0,esk3_0) != esk3_0
| ~ leq(esk4_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_55,negated_conjecture,
( addition(esk4_0,addition(multiplication(esk2_0,esk3_0),X1)) = addition(multiplication(esk2_0,esk3_0),X1)
| addition(esk4_0,esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_46]) ).
cnf(c_0_56,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_58,plain,
( multiplication(esk1_1(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_25]) ).
cnf(c_0_59,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,plain,
( addition(X1,addition(X2,esk1_1(X1))) = addition(X2,one)
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_31]) ).
cnf(c_0_61,negated_conjecture,
addition(esk4_0,addition(esk2_0,X1)) = addition(esk2_0,X1),
inference(spm,[status(thm)],[c_0_22,c_0_52]) ).
cnf(c_0_62,negated_conjecture,
addition(esk2_0,one) = one,
inference(spm,[status(thm)],[c_0_37,c_0_53]) ).
cnf(c_0_63,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_64,negated_conjecture,
( addition(esk4_0,multiplication(esk2_0,esk3_0)) != multiplication(esk2_0,esk3_0)
| addition(esk4_0,esk3_0) != esk3_0
| addition(esk4_0,esk2_0) != esk2_0 ),
inference(spm,[status(thm)],[c_0_54,c_0_40]) ).
cnf(c_0_65,negated_conjecture,
( addition(esk4_0,addition(X1,multiplication(esk2_0,esk3_0))) = addition(X1,multiplication(esk2_0,esk3_0))
| addition(esk4_0,esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_55,c_0_34]) ).
cnf(c_0_66,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_34]) ).
cnf(c_0_67,plain,
( multiplication(addition(X1,esk1_1(X2)),X2) = multiplication(X1,X2)
| ~ test(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_58]),c_0_59]) ).
cnf(c_0_68,negated_conjecture,
addition(esk2_0,esk1_1(esk4_0)) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63])]) ).
cnf(c_0_69,negated_conjecture,
( addition(esk4_0,multiplication(esk2_0,esk3_0)) != multiplication(esk2_0,esk3_0)
| addition(esk4_0,esk3_0) != esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_52])]) ).
cnf(c_0_70,negated_conjecture,
addition(esk4_0,esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_62]),c_0_57]),c_0_62]),c_0_57])]) ).
cnf(c_0_71,negated_conjecture,
multiplication(esk2_0,esk4_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_57]),c_0_63])]) ).
cnf(c_0_72,negated_conjecture,
addition(esk4_0,multiplication(esk2_0,esk3_0)) != multiplication(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_73,negated_conjecture,
addition(esk4_0,multiplication(esk2_0,X1)) = multiplication(esk2_0,addition(esk4_0,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE017+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % 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 04:45:16 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.2lG5UuW9mj/E---3.1_21263.p
% 11.63/1.96 # Version: 3.1pre001
% 11.63/1.96 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.63/1.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.63/1.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.63/1.96 # Starting new_bool_3 with 300s (1) cores
% 11.63/1.96 # Starting new_bool_1 with 300s (1) cores
% 11.63/1.96 # Starting sh5l with 300s (1) cores
% 11.63/1.96 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21366 completed with status 0
% 11.63/1.96 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.63/1.96 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.63/1.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.63/1.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.63/1.96 # No SInE strategy applied
% 11.63/1.96 # Search class: FGHSM-FFMS21-SFFFFFNN
% 11.63/1.96 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.63/1.96 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 811s (1) cores
% 11.63/1.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.63/1.96 # Starting new_bool_3 with 136s (1) cores
% 11.63/1.96 # Starting new_bool_1 with 136s (1) cores
% 11.63/1.97 # Starting sh5l with 136s (1) cores
% 11.63/1.97 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21382 completed with status 0
% 11.63/1.97 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.63/1.97 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.63/1.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.63/1.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.63/1.97 # No SInE strategy applied
% 11.63/1.97 # Search class: FGHSM-FFMS21-SFFFFFNN
% 11.63/1.97 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.63/1.97 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 811s (1) cores
% 11.63/1.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.63/1.97 # Preprocessing time : 0.001 s
% 11.63/1.97 # Presaturation interreduction done
% 11.63/1.97
% 11.63/1.97 # Proof found!
% 11.63/1.97 # SZS status Theorem
% 11.63/1.97 # SZS output start CNFRefutation
% See solution above
% 11.63/1.97 # Parsed axioms : 17
% 11.63/1.97 # Removed by relevancy pruning/SinE : 0
% 11.63/1.97 # Initial clauses : 28
% 11.63/1.97 # Removed in clause preprocessing : 0
% 11.63/1.97 # Initial clauses in saturation : 28
% 11.63/1.97 # Processed clauses : 6162
% 11.63/1.97 # ...of these trivial : 529
% 11.63/1.97 # ...subsumed : 4345
% 11.63/1.97 # ...remaining for further processing : 1288
% 11.63/1.97 # Other redundant clauses eliminated : 743
% 11.63/1.97 # Clauses deleted for lack of memory : 0
% 11.63/1.97 # Backward-subsumed : 311
% 11.63/1.97 # Backward-rewritten : 253
% 11.63/1.97 # Generated clauses : 145167
% 11.63/1.97 # ...of the previous two non-redundant : 117746
% 11.63/1.97 # ...aggressively subsumed : 0
% 11.63/1.97 # Contextual simplify-reflections : 60
% 11.63/1.97 # Paramodulations : 144422
% 11.63/1.97 # Factorizations : 0
% 11.63/1.97 # NegExts : 0
% 11.63/1.97 # Equation resolutions : 743
% 11.63/1.97 # Total rewrite steps : 171910
% 11.63/1.97 # Propositional unsat checks : 0
% 11.63/1.97 # Propositional check models : 0
% 11.63/1.97 # Propositional check unsatisfiable : 0
% 11.63/1.97 # Propositional clauses : 0
% 11.63/1.97 # Propositional clauses after purity: 0
% 11.63/1.97 # Propositional unsat core size : 0
% 11.63/1.97 # Propositional preprocessing time : 0.000
% 11.63/1.97 # Propositional encoding time : 0.000
% 11.63/1.97 # Propositional solver time : 0.000
% 11.63/1.97 # Success case prop preproc time : 0.000
% 11.63/1.97 # Success case prop encoding time : 0.000
% 11.63/1.97 # Success case prop solver time : 0.000
% 11.63/1.97 # Current number of processed clauses : 693
% 11.63/1.97 # Positive orientable unit clauses : 226
% 11.63/1.97 # Positive unorientable unit clauses: 18
% 11.63/1.97 # Negative unit clauses : 17
% 11.63/1.97 # Non-unit-clauses : 432
% 11.63/1.97 # Current number of unprocessed clauses: 110307
% 11.63/1.97 # ...number of literals in the above : 302324
% 11.63/1.97 # Current number of archived formulas : 0
% 11.63/1.97 # Current number of archived clauses : 594
% 11.63/1.97 # Clause-clause subsumption calls (NU) : 60268
% 11.63/1.97 # Rec. Clause-clause subsumption calls : 49929
% 11.63/1.97 # Non-unit clause-clause subsumptions : 3714
% 11.63/1.97 # Unit Clause-clause subsumption calls : 1702
% 11.63/1.97 # Rewrite failures with RHS unbound : 0
% 11.63/1.97 # BW rewrite match attempts : 444
% 11.63/1.97 # BW rewrite match successes : 150
% 11.63/1.97 # Condensation attempts : 0
% 11.63/1.97 # Condensation successes : 0
% 11.63/1.97 # Termbank termtop insertions : 2360071
% 11.63/1.97
% 11.63/1.97 # -------------------------------------------------
% 11.63/1.97 # User time : 1.321 s
% 11.63/1.97 # System time : 0.059 s
% 11.63/1.97 # Total time : 1.380 s
% 11.63/1.97 # Maximum resident set size: 1756 pages
% 11.63/1.97
% 11.63/1.97 # -------------------------------------------------
% 11.63/1.97 # User time : 6.932 s
% 11.63/1.97 # System time : 0.146 s
% 11.63/1.97 # Total time : 7.078 s
% 11.63/1.97 # Maximum resident set size: 1688 pages
% 11.63/1.97 % E---3.1 exiting
%------------------------------------------------------------------------------