TSTP Solution File: KLE011+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE011+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:37 EDT 2023
% Result : Theorem 1.58s 0.70s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 75 ( 61 unt; 0 def)
% Number of atoms : 110 ( 67 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 58 ( 23 ~; 18 |; 11 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 84 ( 1 sgn; 44 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.78cNIKO13M/E---3.1_1504.p',test_3) ).
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(multiplication(addition(X5,c(X5)),X4),multiplication(addition(X4,c(X4)),X5)),multiplication(c(X4),c(X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.78cNIKO13M/E---3.1_1504.p',goals) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.78cNIKO13M/E---3.1_1504.p',test_1) ).
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.78cNIKO13M/E---3.1_1504.p',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.78cNIKO13M/E---3.1_1504.p',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.78cNIKO13M/E---3.1_1504.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.78cNIKO13M/E---3.1_1504.p',additive_idempotence) ).
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.78cNIKO13M/E---3.1_1504.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.78cNIKO13M/E---3.1_1504.p',multiplicative_left_identity) ).
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.78cNIKO13M/E---3.1_1504.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.78cNIKO13M/E---3.1_1504.p',multiplicative_right_identity) ).
fof(c_0_11,plain,
! [X34,X35] :
( ( c(X34) != X35
| complement(X34,X35)
| ~ test(X34) )
& ( ~ complement(X34,X35)
| c(X34) = X35
| ~ test(X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(multiplication(addition(X5,c(X5)),X4),multiplication(addition(X4,c(X4)),X5)),multiplication(c(X4),c(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_13,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,negated_conjecture,
( test(esk3_0)
& test(esk2_0)
& one != addition(addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),multiplication(addition(esk2_0,c(esk2_0)),esk3_0)),multiplication(c(esk2_0),c(esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_15,plain,
! [X28,X30,X31] :
( ( ~ test(X28)
| complement(esk1_1(X28),X28) )
& ( ~ complement(X31,X30)
| test(X30) ) ),
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_16,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( test(X2)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X32,X33] :
( ( multiplication(X32,X33) = zero
| ~ complement(X33,X32) )
& ( multiplication(X33,X32) = zero
| ~ complement(X33,X32) )
& ( addition(X32,X33) = one
| ~ complement(X33,X32) )
& ( multiplication(X32,X33) != zero
| multiplication(X33,X32) != zero
| addition(X32,X33) != one
| complement(X33,X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_21,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_23,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_24,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_25,negated_conjecture,
test(c(esk2_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_26,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_27,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
complement(esk3_0,c(esk3_0)),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_29,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_31,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
complement(c(esk2_0),c(c(esk2_0))),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_34,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_37,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_38,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_39,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
addition(c(esk2_0),c(c(esk2_0))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_33]),c_0_29]) ).
fof(c_0_41,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_42,negated_conjecture,
complement(esk1_1(esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_34,c_0_17]) ).
cnf(c_0_43,negated_conjecture,
complement(esk1_1(esk3_0),esk3_0),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_44,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_31]) ).
cnf(c_0_45,negated_conjecture,
addition(multiplication(esk3_0,X1),multiplication(c(esk3_0),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_46,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,negated_conjecture,
addition(one,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_29]) ).
cnf(c_0_48,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,negated_conjecture,
addition(esk2_0,esk1_1(esk2_0)) = one,
inference(spm,[status(thm)],[c_0_27,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
test(c(esk3_0)),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_51,negated_conjecture,
addition(esk3_0,esk1_1(esk3_0)) = one,
inference(spm,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
one != addition(addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),multiplication(addition(esk2_0,c(esk2_0)),esk3_0)),multiplication(c(esk2_0),c(esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_53,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_29]) ).
cnf(c_0_54,negated_conjecture,
addition(multiplication(esk3_0,X1),addition(X2,multiplication(c(esk3_0),X1))) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_55,negated_conjecture,
addition(X1,multiplication(X1,c(esk2_0))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_48]) ).
cnf(c_0_56,negated_conjecture,
addition(one,esk2_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_49]),c_0_29]) ).
cnf(c_0_57,negated_conjecture,
complement(c(esk3_0),c(c(esk3_0))),
inference(spm,[status(thm)],[c_0_16,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_51]),c_0_29]) ).
cnf(c_0_59,negated_conjecture,
addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0))))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_29]),c_0_29]),c_0_35]),c_0_35]),c_0_31]) ).
cnf(c_0_60,negated_conjecture,
addition(multiplication(X1,esk3_0),multiplication(X1,c(esk3_0))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_36]),c_0_48]) ).
cnf(c_0_61,negated_conjecture,
addition(multiplication(X1,esk2_0),multiplication(X1,c(esk2_0))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_53]),c_0_48]) ).
cnf(c_0_62,negated_conjecture,
addition(c(esk3_0),multiplication(esk3_0,c(esk2_0))) = addition(c(esk2_0),c(esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_29]),c_0_29]) ).
cnf(c_0_63,negated_conjecture,
addition(X1,multiplication(X1,esk2_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_56]),c_0_48]),c_0_48]) ).
cnf(c_0_64,negated_conjecture,
addition(c(esk3_0),c(c(esk3_0))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_57]),c_0_29]) ).
cnf(c_0_65,negated_conjecture,
addition(one,addition(esk2_0,X1)) = addition(one,X1),
inference(spm,[status(thm)],[c_0_31,c_0_56]) ).
cnf(c_0_66,negated_conjecture,
addition(X1,multiplication(X1,esk3_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_58]),c_0_48]),c_0_48]) ).
cnf(c_0_67,negated_conjecture,
addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),multiplication(c(esk3_0),esk2_0))))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_44]),c_0_44]),c_0_44]),c_0_44]) ).
cnf(c_0_68,negated_conjecture,
addition(multiplication(X1,esk3_0),addition(multiplication(X1,c(esk3_0)),X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_60]) ).
cnf(c_0_69,negated_conjecture,
addition(c(esk2_0),multiplication(c(esk3_0),esk2_0)) = addition(c(esk2_0),c(esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_61]),c_0_29]),c_0_29]),c_0_62]) ).
cnf(c_0_70,negated_conjecture,
addition(c(esk3_0),multiplication(esk3_0,esk2_0)) = addition(esk2_0,c(esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_63]),c_0_29]),c_0_29]) ).
cnf(c_0_71,negated_conjecture,
addition(esk2_0,addition(c(esk2_0),X1)) = addition(one,X1),
inference(spm,[status(thm)],[c_0_31,c_0_53]) ).
cnf(c_0_72,negated_conjecture,
addition(one,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_64]),c_0_29]) ).
cnf(c_0_73,negated_conjecture,
addition(one,multiplication(esk2_0,esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_56]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[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_67,c_0_68]),c_0_69]),c_0_29]),c_0_31]),c_0_70]),c_0_44]),c_0_71]),c_0_72]),c_0_29]),c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KLE011+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n031.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Oct 3 05:17:14 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.19/0.45 Running first-order model finding
% 0.19/0.45 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.78cNIKO13M/E---3.1_1504.p
% 1.58/0.70 # Version: 3.1pre001
% 1.58/0.70 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.58/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/0.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.58/0.70 # Starting new_bool_3 with 300s (1) cores
% 1.58/0.70 # Starting new_bool_1 with 300s (1) cores
% 1.58/0.70 # Starting sh5l with 300s (1) cores
% 1.58/0.70 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1629 completed with status 0
% 1.58/0.70 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.58/0.70 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.58/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/0.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.58/0.70 # No SInE strategy applied
% 1.58/0.70 # Search class: FGUSM-FFMF21-MFFFFFNN
% 1.58/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.58/0.70 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 1.58/0.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.58/0.70 # Starting new_bool_3 with 136s (1) cores
% 1.58/0.70 # Starting new_bool_1 with 136s (1) cores
% 1.58/0.70 # Starting sh5l with 136s (1) cores
% 1.58/0.70 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 1634 completed with status 0
% 1.58/0.70 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 1.58/0.70 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.58/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/0.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.58/0.70 # No SInE strategy applied
% 1.58/0.70 # Search class: FGUSM-FFMF21-MFFFFFNN
% 1.58/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.58/0.70 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 1.58/0.70 # Preprocessing time : 0.001 s
% 1.58/0.70
% 1.58/0.70 # Proof found!
% 1.58/0.70 # SZS status Theorem
% 1.58/0.70 # SZS output start CNFRefutation
% See solution above
% 1.58/0.70 # Parsed axioms : 17
% 1.58/0.70 # Removed by relevancy pruning/SinE : 0
% 1.58/0.70 # Initial clauses : 25
% 1.58/0.70 # Removed in clause preprocessing : 0
% 1.58/0.70 # Initial clauses in saturation : 25
% 1.58/0.70 # Processed clauses : 2403
% 1.58/0.70 # ...of these trivial : 303
% 1.58/0.70 # ...subsumed : 1513
% 1.58/0.70 # ...remaining for further processing : 587
% 1.58/0.70 # Other redundant clauses eliminated : 187
% 1.58/0.70 # Clauses deleted for lack of memory : 0
% 1.58/0.70 # Backward-subsumed : 2
% 1.58/0.70 # Backward-rewritten : 104
% 1.58/0.70 # Generated clauses : 12499
% 1.58/0.70 # ...of the previous two non-redundant : 9132
% 1.58/0.70 # ...aggressively subsumed : 0
% 1.58/0.70 # Contextual simplify-reflections : 0
% 1.58/0.70 # Paramodulations : 12312
% 1.58/0.70 # Factorizations : 0
% 1.58/0.70 # NegExts : 0
% 1.58/0.70 # Equation resolutions : 187
% 1.58/0.70 # Total rewrite steps : 17802
% 1.58/0.70 # Propositional unsat checks : 0
% 1.58/0.70 # Propositional check models : 0
% 1.58/0.70 # Propositional check unsatisfiable : 0
% 1.58/0.70 # Propositional clauses : 0
% 1.58/0.70 # Propositional clauses after purity: 0
% 1.58/0.70 # Propositional unsat core size : 0
% 1.58/0.70 # Propositional preprocessing time : 0.000
% 1.58/0.70 # Propositional encoding time : 0.000
% 1.58/0.70 # Propositional solver time : 0.000
% 1.58/0.70 # Success case prop preproc time : 0.000
% 1.58/0.70 # Success case prop encoding time : 0.000
% 1.58/0.70 # Success case prop solver time : 0.000
% 1.58/0.70 # Current number of processed clauses : 480
% 1.58/0.70 # Positive orientable unit clauses : 223
% 1.58/0.70 # Positive unorientable unit clauses: 5
% 1.58/0.70 # Negative unit clauses : 1
% 1.58/0.70 # Non-unit-clauses : 251
% 1.58/0.70 # Current number of unprocessed clauses: 6409
% 1.58/0.70 # ...number of literals in the above : 12794
% 1.58/0.70 # Current number of archived formulas : 0
% 1.58/0.70 # Current number of archived clauses : 106
% 1.58/0.70 # Clause-clause subsumption calls (NU) : 17055
% 1.58/0.70 # Rec. Clause-clause subsumption calls : 14899
% 1.58/0.70 # Non-unit clause-clause subsumptions : 1313
% 1.58/0.70 # Unit Clause-clause subsumption calls : 1392
% 1.58/0.70 # Rewrite failures with RHS unbound : 0
% 1.58/0.70 # BW rewrite match attempts : 676
% 1.58/0.70 # BW rewrite match successes : 152
% 1.58/0.70 # Condensation attempts : 0
% 1.58/0.70 # Condensation successes : 0
% 1.58/0.70 # Termbank termtop insertions : 160382
% 1.58/0.70
% 1.58/0.70 # -------------------------------------------------
% 1.58/0.70 # User time : 0.190 s
% 1.58/0.70 # System time : 0.042 s
% 1.58/0.70 # Total time : 0.232 s
% 1.58/0.70 # Maximum resident set size: 1776 pages
% 1.58/0.70
% 1.58/0.70 # -------------------------------------------------
% 1.58/0.70 # User time : 1.082 s
% 1.58/0.70 # System time : 0.059 s
% 1.58/0.70 # Total time : 1.142 s
% 1.58/0.70 # Maximum resident set size: 1684 pages
% 1.58/0.70 % E---3.1 exiting
%------------------------------------------------------------------------------