TSTP Solution File: SWV487+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV487+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : Tue May 21 05:36:42 EDT 2024
% Result : Theorem 2.01s 0.79s
% Output : CNFRefutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 12 unt; 0 def)
% Number of atoms : 192 ( 44 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 208 ( 74 ~; 74 |; 36 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 61 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(int_less_irreflexive,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_irreflexive) ).
fof(int_less_transitive,axiom,
! [X1,X2,X3] :
( ( int_less(X1,X2)
& int_less(X2,X3) )
=> int_less(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive) ).
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( int_less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
fof(ut,conjecture,
! [X1,X2] :
( ( int_leq(int_one,X2)
& int_less(X2,X1)
& int_leq(X1,n) )
=> a(X1,X2) = real_zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ut) ).
fof(plus_and_inverse,axiom,
! [X1,X2] :
( int_less(X1,X2)
<=> ? [X3] :
( plus(X1,X3) = X2
& int_less(int_zero,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(one_successor_of_zero,axiom,
! [X1] :
( int_less(int_zero,X1)
<=> int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(int_less_total,axiom,
! [X1,X2] :
( int_less(X1,X2)
| int_leq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_total) ).
fof(qiu,hypothesis,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = real_zero ) )
& ! [X8] :
( ( int_leq(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = lu(X3,plus(X3,X8)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qiu) ).
fof(c_0_8,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = real_zero ) )
& ! [X8] :
( ( int_leq(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = lu(X3,plus(X3,X8)) ) ) ) ),
introduced(definition) ).
fof(c_0_9,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = real_zero ) )
& ! [X8] :
( ( int_leq(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = lu(X3,plus(X3,X8)) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
inference(fof_simplification,[status(thm)],[int_less_irreflexive]) ).
fof(c_0_11,plain,
! [X31,X32,X33] :
( ~ int_less(X31,X32)
| ~ int_less(X32,X33)
| int_less(X31,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])])]) ).
fof(c_0_12,plain,
! [X26,X27] :
( ( ~ int_leq(X26,X27)
| int_less(X26,X27)
| X26 = X27 )
& ( ~ int_less(X26,X27)
| int_leq(X26,X27) )
& ( X26 != X27
| int_leq(X26,X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(int_one,X2)
& int_less(X2,X1)
& int_leq(X1,n) )
=> a(X1,X2) = real_zero ),
inference(assume_negation,[status(cth)],[ut]) ).
fof(c_0_14,plain,
! [X36,X37,X38,X39,X40,X41] :
( ( ~ int_less(int_zero,X38)
| X37 != plus(X36,X38)
| ~ int_leq(int_one,X39)
| ~ int_leq(X39,X36)
| a(plus(X39,X38),X39) = real_zero
| ~ epred1_2(X37,X36) )
& ( ~ int_leq(int_zero,X40)
| X36 != plus(X37,X40)
| ~ int_leq(int_one,X41)
| ~ int_leq(X41,X37)
| a(X41,plus(X41,X40)) = lu(X41,plus(X41,X40))
| ~ epred1_2(X37,X36) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_15,plain,
! [X34,X35] :
( ~ int_less(X34,X35)
| X34 != X35 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_16,plain,
( int_less(X1,X3)
| ~ int_less(X1,X2)
| ~ int_less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( int_less(X1,X2)
| X1 = X2
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,negated_conjecture,
( int_leq(int_one,esk2_0)
& int_less(esk2_0,esk1_0)
& int_leq(esk1_0,n)
& a(esk1_0,esk2_0) != real_zero ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_19,plain,
( a(plus(X4,X1),X4) = real_zero
| ~ int_less(int_zero,X1)
| X2 != plus(X3,X1)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X3)
| ~ epred1_2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X20,X21,X23,X24,X25] :
( ( plus(X20,esk3_2(X20,X21)) = X21
| ~ int_less(X20,X21) )
& ( int_less(int_zero,esk3_2(X20,X21))
| ~ int_less(X20,X21) )
& ( plus(X23,X25) != X24
| ~ int_less(int_zero,X25)
| int_less(X23,X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_inverse])])])])])])]) ).
cnf(c_0_21,plain,
( ~ int_less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( X1 = X2
| int_less(X3,X2)
| ~ int_less(X3,X1)
| ~ int_leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
int_leq(esk1_0,n),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
int_less(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( a(plus(X1,X2),X1) = real_zero
| ~ epred1_2(plus(X3,X2),X3)
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X3) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( plus(X1,esk3_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( int_less(int_zero,esk3_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_29,plain,
! [X30] :
( ( ~ int_less(int_zero,X30)
| int_leq(int_one,X30) )
& ( ~ int_leq(int_one,X30)
| int_less(int_zero,X30) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_successor_of_zero])])]) ).
cnf(c_0_30,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( n = esk1_0
| int_less(X1,n)
| ~ int_less(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,negated_conjecture,
( int_less(X1,esk1_0)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
fof(c_0_34,plain,
! [X28,X29] :
( int_less(X28,X29)
| int_leq(X29,X28) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
cnf(c_0_35,plain,
( a(plus(X1,esk3_2(X2,X3)),X1) = real_zero
| ~ epred1_2(X3,X2)
| ~ int_less(X2,X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_36,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_28]) ).
fof(c_0_37,hypothesis,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> epred1_2(X1,X2) ),
inference(apply_def,[status(thm)],[qiu,c_0_8]) ).
cnf(c_0_38,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( n = esk1_0
| ~ int_less(n,esk1_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( int_leq(X1,esk1_0)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
( int_less(X1,X2)
| int_leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
a(esk1_0,esk2_0) != real_zero,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X2,X1)
| ~ int_leq(int_one,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_26]),c_0_36])]) ).
cnf(c_0_44,negated_conjecture,
int_leq(int_one,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_45,hypothesis,
! [X9,X10] :
( ~ int_leq(int_one,X9)
| ~ int_leq(X9,n)
| ~ int_leq(int_one,X10)
| ~ int_leq(X10,n)
| epred1_2(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])]) ).
cnf(c_0_46,negated_conjecture,
( int_leq(int_one,esk1_0)
| ~ int_less(int_zero,esk2_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_47,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_48,negated_conjecture,
( n = esk1_0
| ~ int_leq(n,esk1_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_49,negated_conjecture,
( int_leq(esk2_0,X1)
| int_leq(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,negated_conjecture,
~ epred1_2(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24]),c_0_44])]) ).
cnf(c_0_51,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,negated_conjecture,
int_leq(int_one,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44])]) ).
cnf(c_0_53,negated_conjecture,
( n = esk1_0
| int_leq(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,hypothesis,
~ int_leq(esk2_0,n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_23]),c_0_44]),c_0_52])]) ).
cnf(c_0_55,negated_conjecture,
n = esk1_0,
inference(sr,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
int_leq(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_57,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV487+1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 07:34:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.19/0.51 Running first-order model finding
% 0.19/0.51 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/benchmark/theBenchmark.p
% 2.01/0.79 # Version: 3.1.0
% 2.01/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.01/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.01/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.01/0.79 # Starting new_bool_3 with 300s (1) cores
% 2.01/0.79 # Starting new_bool_1 with 300s (1) cores
% 2.01/0.79 # Starting sh5l with 300s (1) cores
% 2.01/0.79 # new_bool_1 with pid 8034 completed with status 0
% 2.01/0.79 # Result found by new_bool_1
% 2.01/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.01/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.01/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.01/0.79 # Starting new_bool_3 with 300s (1) cores
% 2.01/0.79 # Starting new_bool_1 with 300s (1) cores
% 2.01/0.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.01/0.79 # Search class: FGHSS-FFSS22-SFFFFFNN
% 2.01/0.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.01/0.79 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.01/0.79 # SAT001_MinMin_p005000_rr_RG with pid 8043 completed with status 0
% 2.01/0.79 # Result found by SAT001_MinMin_p005000_rr_RG
% 2.01/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.01/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.01/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.01/0.79 # Starting new_bool_3 with 300s (1) cores
% 2.01/0.79 # Starting new_bool_1 with 300s (1) cores
% 2.01/0.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.01/0.79 # Search class: FGHSS-FFSS22-SFFFFFNN
% 2.01/0.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.01/0.79 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.01/0.79 # Preprocessing time : 0.002 s
% 2.01/0.79 # Presaturation interreduction done
% 2.01/0.79
% 2.01/0.79 # Proof found!
% 2.01/0.79 # SZS status Theorem
% 2.01/0.79 # SZS output start CNFRefutation
% See solution above
% 2.01/0.79 # Parsed axioms : 13
% 2.01/0.79 # Removed by relevancy pruning/SinE : 1
% 2.01/0.79 # Initial clauses : 22
% 2.01/0.79 # Removed in clause preprocessing : 0
% 2.01/0.79 # Initial clauses in saturation : 22
% 2.01/0.79 # Processed clauses : 2980
% 2.01/0.79 # ...of these trivial : 3
% 2.01/0.79 # ...subsumed : 2378
% 2.01/0.79 # ...remaining for further processing : 599
% 2.01/0.79 # Other redundant clauses eliminated : 5
% 2.01/0.79 # Clauses deleted for lack of memory : 0
% 2.01/0.79 # Backward-subsumed : 46
% 2.01/0.79 # Backward-rewritten : 92
% 2.01/0.79 # Generated clauses : 12089
% 2.01/0.79 # ...of the previous two non-redundant : 9868
% 2.01/0.79 # ...aggressively subsumed : 0
% 2.01/0.79 # Contextual simplify-reflections : 6
% 2.01/0.79 # Paramodulations : 12081
% 2.01/0.79 # Factorizations : 2
% 2.01/0.79 # NegExts : 0
% 2.01/0.79 # Equation resolutions : 5
% 2.01/0.79 # Disequality decompositions : 0
% 2.01/0.79 # Total rewrite steps : 2802
% 2.01/0.79 # ...of those cached : 2776
% 2.01/0.79 # Propositional unsat checks : 0
% 2.01/0.79 # Propositional check models : 0
% 2.01/0.79 # Propositional check unsatisfiable : 0
% 2.01/0.79 # Propositional clauses : 0
% 2.01/0.79 # Propositional clauses after purity: 0
% 2.01/0.79 # Propositional unsat core size : 0
% 2.01/0.79 # Propositional preprocessing time : 0.000
% 2.01/0.79 # Propositional encoding time : 0.000
% 2.01/0.79 # Propositional solver time : 0.000
% 2.01/0.79 # Success case prop preproc time : 0.000
% 2.01/0.79 # Success case prop encoding time : 0.000
% 2.01/0.79 # Success case prop solver time : 0.000
% 2.01/0.79 # Current number of processed clauses : 433
% 2.01/0.79 # Positive orientable unit clauses : 12
% 2.01/0.79 # Positive unorientable unit clauses: 1
% 2.01/0.79 # Negative unit clauses : 7
% 2.01/0.79 # Non-unit-clauses : 413
% 2.01/0.79 # Current number of unprocessed clauses: 6788
% 2.01/0.79 # ...number of literals in the above : 32332
% 2.01/0.79 # Current number of archived formulas : 0
% 2.01/0.79 # Current number of archived clauses : 161
% 2.01/0.79 # Clause-clause subsumption calls (NU) : 41166
% 2.01/0.79 # Rec. Clause-clause subsumption calls : 22222
% 2.01/0.79 # Non-unit clause-clause subsumptions : 1926
% 2.01/0.79 # Unit Clause-clause subsumption calls : 849
% 2.01/0.79 # Rewrite failures with RHS unbound : 0
% 2.01/0.79 # BW rewrite match attempts : 10
% 2.01/0.79 # BW rewrite match successes : 6
% 2.01/0.79 # Condensation attempts : 0
% 2.01/0.79 # Condensation successes : 0
% 2.01/0.79 # Termbank termtop insertions : 139402
% 2.01/0.79 # Search garbage collected termcells : 361
% 2.01/0.79
% 2.01/0.79 # -------------------------------------------------
% 2.01/0.79 # User time : 0.257 s
% 2.01/0.79 # System time : 0.007 s
% 2.01/0.79 # Total time : 0.264 s
% 2.01/0.79 # Maximum resident set size: 1720 pages
% 2.01/0.79
% 2.01/0.79 # -------------------------------------------------
% 2.01/0.79 # User time : 0.259 s
% 2.01/0.79 # System time : 0.010 s
% 2.01/0.79 # Total time : 0.268 s
% 2.01/0.79 # Maximum resident set size: 1700 pages
% 2.01/0.79 % E---3.1 exiting
%------------------------------------------------------------------------------