TSTP Solution File: CSR018+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR018+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:31:13 EDT 2024
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 23 unt; 0 def)
% Number of atoms : 342 ( 187 equ)
% Maximal formula atoms : 120 ( 6 avg)
% Number of connectives : 412 ( 122 ~; 208 |; 73 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(happens_holds,axiom,
! [X4,X5,X2] :
( ( happens(X4,X5)
& initiates(X4,X2,X5) )
=> holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',happens_holds) ).
fof(initiates_all_defn,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> ( ( X4 = push
& X2 = forwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = backwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = spinning
& happens(push,X5) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',initiates_all_defn) ).
fof(plus1_1,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',plus1_1) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X4 = push
& X5 = n0 )
| ( X4 = pull
& X5 = n1 )
| ( X4 = pull
& X5 = n2 )
| ( X4 = push
& X5 = n2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',happens_all_defn) ).
fof(backwards_2,conjecture,
holdsAt(backwards,n2),
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',backwards_2) ).
fof(push_not_pull,axiom,
push != pull,
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',push_not_pull) ).
fof(less_or_equal,axiom,
! [X9,X10] :
( less_or_equal(X9,X10)
<=> ( less(X9,X10)
| X9 = X10 ) ),
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',less_or_equal) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',symmetry_of_plus) ).
fof(less_property,axiom,
! [X9,X10] :
( less(X9,X10)
<=> ( ~ less(X10,X9)
& X10 != X9 ) ),
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',less_property) ).
fof(less2,axiom,
! [X9] :
( less(X9,n2)
<=> less_or_equal(X9,n1) ),
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',less2) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/tmp/tmp.PDBhdiJsYl/E---3.1_26948.p',plus0_1) ).
fof(c_0_11,plain,
! [X2,X4,X5] :
( epred1_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = forwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = backwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = spinning
& happens(push,X5) ) ) ),
introduced(definition) ).
fof(c_0_12,plain,
! [X19,X20,X21] :
( ~ happens(X19,X20)
| ~ initiates(X19,X21,X20)
| holdsAt(X21,plus(X20,n1)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_holds])])]) ).
fof(c_0_13,plain,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> epred1_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[initiates_all_defn]),c_0_11]) ).
cnf(c_0_14,plain,
( holdsAt(X3,plus(X2,n1))
| ~ happens(X1,X2)
| ~ initiates(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[plus1_1]) ).
fof(c_0_16,plain,
! [X27,X28,X29] :
( ( ~ initiates(X27,X28,X29)
| epred1_3(X29,X27,X28) )
& ( ~ epred1_3(X29,X27,X28)
| initiates(X27,X28,X29) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_17,plain,
! [X49,X50,X51] :
( ( X50 = pull
| X50 = pull
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X50 = pull
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X50 = pull
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X49 = backwards
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X49 = backwards
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X49 = backwards
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| ~ happens(push,X51)
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| ~ happens(push,X51)
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| ~ happens(push,X51)
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X50 = pull
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X50 = pull
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X50 = pull
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X49 = backwards
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X49 = backwards
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X49 = backwards
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| ~ happens(push,X51)
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| ~ happens(push,X51)
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| ~ happens(push,X51)
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X50 = pull
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X50 = pull
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X50 = pull
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X49 = backwards
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X49 = backwards
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X49 = backwards
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| ~ happens(push,X51)
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| ~ happens(push,X51)
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| ~ happens(push,X51)
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X50 != push
| X49 != forwards
| happens(pull,X51)
| epred1_3(X51,X50,X49) )
& ( X50 != pull
| X49 != backwards
| happens(push,X51)
| epred1_3(X51,X50,X49) )
& ( X50 != pull
| X49 != spinning
| ~ happens(push,X51)
| epred1_3(X51,X50,X49) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_18,plain,
! [X47,X48] :
( ( X47 = push
| X47 = pull
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 != push
| X48 != n0
| happens(X47,X48) )
& ( X47 != pull
| X48 != n1
| happens(X47,X48) )
& ( X47 != pull
| X48 != n2
| happens(X47,X48) )
& ( X47 != push
| X48 != n2
| happens(X47,X48) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])]) ).
fof(c_0_19,negated_conjecture,
~ holdsAt(backwards,n2),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[backwards_2])]) ).
cnf(c_0_20,plain,
( holdsAt(X1,n2)
| ~ initiates(X2,X1,n1)
| ~ happens(X2,n1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( initiates(X2,X3,X1)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( happens(push,X3)
| epred1_3(X3,X1,X2)
| X1 != pull
| X2 != backwards ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( happens(X1,X2)
| X1 != pull
| X2 != n1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,negated_conjecture,
~ holdsAt(backwards,n2),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
fof(c_0_25,plain,
push != pull,
inference(fof_simplification,[status(thm)],[push_not_pull]) ).
fof(c_0_26,plain,
! [X45,X46] :
( ( ~ less_or_equal(X45,X46)
| less(X45,X46)
| X45 = X46 )
& ( ~ less(X45,X46)
| less_or_equal(X45,X46) )
& ( X45 != X46
| less_or_equal(X45,X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])]) ).
fof(c_0_27,plain,
! [X41,X42] : plus(X41,X42) = plus(X42,X41),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
cnf(c_0_28,plain,
( X1 = n2
| X1 = n2
| X2 = pull
| X1 = n0
| ~ happens(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( holdsAt(X1,n2)
| ~ epred1_3(n1,X2,X1)
| ~ happens(X2,n1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( epred1_3(X1,pull,backwards)
| happens(push,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_31,plain,
happens(pull,n1),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
~ holdsAt(backwards,n2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_33,plain,
push != pull,
inference(fof_nnf,[status(thm)],[c_0_25]) ).
fof(c_0_34,plain,
! [X9,X10] :
( less(X9,X10)
<=> ( ~ less(X10,X9)
& X10 != X9 ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_35,plain,
! [X39] :
( ( ~ less(X39,n2)
| less_or_equal(X39,n1) )
& ( ~ less_or_equal(X39,n1)
| less(X39,n2) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])]) ).
cnf(c_0_36,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
cnf(c_0_38,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( X2 = pull
| X1 = n0
| X1 = n2
| ~ happens(X2,X1) ),
inference(cn,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
happens(push,n1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_41,plain,
push != pull,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_42,plain,
! [X43,X44] :
( ( ~ less(X44,X43)
| ~ less(X43,X44) )
& ( X44 != X43
| ~ less(X43,X44) )
& ( less(X44,X43)
| X44 = X43
| less(X43,X44) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).
cnf(c_0_43,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
( n2 = n1
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_47,plain,
( X1 != X2
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
n2 = n1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_15])]) ).
cnf(c_0_50,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_51,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : CSR018+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n010.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 14:57:22 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.PDBhdiJsYl/E---3.1_26948.p
% 0.14/0.42 # Version: 3.1.0
% 0.14/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # new_bool_3 with pid 27028 completed with status 0
% 0.14/0.42 # Result found by new_bool_3
% 0.14/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.14/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.14/0.42 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 27032 completed with status 0
% 0.14/0.42 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.14/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.14/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.14/0.42 # Preprocessing time : 0.002 s
% 0.14/0.42 # Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 # Proof found!
% 0.14/0.42 # SZS status Theorem
% 0.14/0.42 # SZS output start CNFRefutation
% See solution above
% 0.14/0.42 # Parsed axioms : 48
% 0.14/0.42 # Removed by relevancy pruning/SinE : 17
% 0.14/0.42 # Initial clauses : 154
% 0.14/0.42 # Removed in clause preprocessing : 9
% 0.14/0.42 # Initial clauses in saturation : 145
% 0.14/0.42 # Processed clauses : 360
% 0.14/0.42 # ...of these trivial : 0
% 0.14/0.42 # ...subsumed : 116
% 0.14/0.42 # ...remaining for further processing : 244
% 0.14/0.42 # Other redundant clauses eliminated : 54
% 0.14/0.42 # Clauses deleted for lack of memory : 0
% 0.14/0.42 # Backward-subsumed : 2
% 0.14/0.42 # Backward-rewritten : 50
% 0.14/0.42 # Generated clauses : 271
% 0.14/0.42 # ...of the previous two non-redundant : 206
% 0.14/0.42 # ...aggressively subsumed : 0
% 0.14/0.42 # Contextual simplify-reflections : 4
% 0.14/0.42 # Paramodulations : 165
% 0.14/0.42 # Factorizations : 65
% 0.14/0.42 # NegExts : 0
% 0.14/0.42 # Equation resolutions : 54
% 0.14/0.42 # Disequality decompositions : 0
% 0.14/0.42 # Total rewrite steps : 90
% 0.14/0.42 # ...of those cached : 72
% 0.14/0.42 # Propositional unsat checks : 0
% 0.14/0.42 # Propositional check models : 0
% 0.14/0.42 # Propositional check unsatisfiable : 0
% 0.14/0.42 # Propositional clauses : 0
% 0.14/0.42 # Propositional clauses after purity: 0
% 0.14/0.42 # Propositional unsat core size : 0
% 0.14/0.42 # Propositional preprocessing time : 0.000
% 0.14/0.42 # Propositional encoding time : 0.000
% 0.14/0.42 # Propositional solver time : 0.000
% 0.14/0.42 # Success case prop preproc time : 0.000
% 0.14/0.42 # Success case prop encoding time : 0.000
% 0.14/0.42 # Success case prop solver time : 0.000
% 0.14/0.42 # Current number of processed clauses : 96
% 0.14/0.42 # Positive orientable unit clauses : 10
% 0.14/0.42 # Positive unorientable unit clauses: 1
% 0.14/0.42 # Negative unit clauses : 14
% 0.14/0.42 # Non-unit-clauses : 71
% 0.14/0.42 # Current number of unprocessed clauses: 44
% 0.14/0.42 # ...number of literals in the above : 136
% 0.14/0.42 # Current number of archived formulas : 0
% 0.14/0.42 # Current number of archived clauses : 133
% 0.14/0.42 # Clause-clause subsumption calls (NU) : 1487
% 0.14/0.42 # Rec. Clause-clause subsumption calls : 928
% 0.14/0.42 # Non-unit clause-clause subsumptions : 94
% 0.14/0.42 # Unit Clause-clause subsumption calls : 205
% 0.14/0.42 # Rewrite failures with RHS unbound : 0
% 0.14/0.42 # BW rewrite match attempts : 28
% 0.14/0.42 # BW rewrite match successes : 27
% 0.14/0.42 # Condensation attempts : 0
% 0.14/0.42 # Condensation successes : 0
% 0.14/0.42 # Termbank termtop insertions : 9255
% 0.14/0.42 # Search garbage collected termcells : 1355
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.018 s
% 0.14/0.42 # System time : 0.002 s
% 0.14/0.42 # Total time : 0.019 s
% 0.14/0.42 # Maximum resident set size: 2112 pages
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.019 s
% 0.14/0.42 # System time : 0.003 s
% 0.14/0.42 # Total time : 0.023 s
% 0.14/0.42 # Maximum resident set size: 1744 pages
% 0.14/0.42 % E---3.1 exiting
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------