TSTP Solution File: NUM021^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM021^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 01:05:51 EDT 2024
% Result : Theorem 3.20s 0.85s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 53 ( 38 unt; 8 typ; 0 def)
% Number of atoms : 52 ( 51 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 265 ( 12 ~; 5 |; 2 &; 246 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 241 ( 241 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 1 con; 0-4 aty)
% Number of variables : 99 ( 16 ^ 81 !; 2 ?; 99 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
one: ( $i > $i ) > $i > $i ).
thf(decl_24,type,
two: ( $i > $i ) > $i > $i ).
thf(decl_25,type,
three: ( $i > $i ) > $i > $i ).
thf(decl_27,type,
five: ( $i > $i ) > $i > $i ).
thf(decl_34,type,
plus: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(decl_35,type,
mult: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(decl_36,type,
esk1_2: ( ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ) > $i > $i ).
thf(decl_531,type,
esk496_1: ( ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ) > $i ).
thf(mult_ax,axiom,
( mult
= ( ^ [X4: ( $i > $i ) > $i > $i,X3: ( $i > $i ) > $i > $i,X1: $i > $i,X2: $i] : ( X4 @ ( X3 @ X1 ) @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',mult_ax) ).
thf(one_ax,axiom,
( one
= ( ^ [X1: $i > $i,X2: $i] : ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',one_ax) ).
thf(two_ax,axiom,
( two
= ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',two_ax) ).
thf(thm,conjecture,
? [X5: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i] :
( ( ( X5 @ two @ three )
= five )
& ( ( X5 @ one @ two )
= three ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(three_ax,axiom,
( three
= ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',three_ax) ).
thf(plus_ax,axiom,
( plus
= ( ^ [X4: ( $i > $i ) > $i > $i,X3: ( $i > $i ) > $i > $i,X1: $i > $i,X2: $i] : ( X4 @ X1 @ ( X3 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',plus_ax) ).
thf(five_ax,axiom,
( five
= ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',five_ax) ).
thf(c_0_7,plain,
! [X36: ( $i > $i ) > $i > $i,X37: ( $i > $i ) > $i > $i,X38: $i > $i,X39: $i] :
( ( mult @ X36 @ X37 @ X38 @ X39 )
= ( X36 @ ( X37 @ X38 ) @ X39 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[mult_ax])]) ).
thf(c_0_8,plain,
! [X9: $i > $i,X10: $i] :
( ( one @ X9 @ X10 )
= ( X9 @ X10 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[one_ax])]) ).
thf(c_0_9,plain,
! [X69: ( $i > $i ) > $i > $i,X70: ( $i > $i ) > $i > $i,X71: $i > $i,X72: $i] :
( ( mult @ X69 @ X70 @ X71 @ X72 )
= ( X69 @ ( X70 @ X71 ) @ X72 ) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X42: $i > $i,X43: $i] :
( ( one @ X42 @ X43 )
= ( X42 @ X43 ) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
! [X11: $i > $i,X12: $i] :
( ( two @ X11 @ X12 )
= ( X11 @ ( X11 @ X12 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[two_ax])]) ).
thf(c_0_12,negated_conjecture,
~ ? [X5: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i] :
( ( ( X5 @ two @ three )
= five )
& ( ( X5 @ one @ two )
= three ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_13,plain,
! [X1: $i > $i,X4: ( $i > $i ) > $i > $i,X3: ( $i > $i ) > $i > $i,X2: $i] :
( ( mult @ X3 @ X4 @ X1 @ X2 )
= ( X3 @ ( X4 @ X1 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
! [X1: $i > $i,X2: $i] :
( ( one @ X1 @ X2 )
= ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
! [X13: $i > $i,X14: $i] :
( ( three @ X13 @ X14 )
= ( X13 @ ( X13 @ ( X13 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[three_ax])]) ).
thf(c_0_16,plain,
! [X44: $i > $i,X45: $i] :
( ( two @ X44 @ X45 )
= ( X44 @ ( X44 @ X45 ) ) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
! [X73: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i] :
( ( ( X73 @ two @ three )
!= five )
| ( ( X73 @ one @ two )
!= three ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
thf(c_0_18,plain,
! [X1: $i > $i,X4: ( $i > $i ) > $i > $i,X3: ( $i > $i ) > $i > $i,X2: $i] :
( ( one @ ( mult @ X3 @ X4 @ X1 ) @ X2 )
= ( X3 @ ( X4 @ X1 ) @ X2 ) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,plain,
! [X1: $i > $i] :
( ( one @ X1 )
= X1 ),
inference(pos_ext,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
! [X46: $i > $i,X47: $i] :
( ( three @ X46 @ X47 )
= ( X46 @ ( X46 @ ( X46 @ X47 ) ) ) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
thf(c_0_21,plain,
! [X1: $i > $i,X2: $i] :
( ( two @ X1 @ X2 )
= ( X1 @ ( X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_22,negated_conjecture,
! [X5: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i] :
( ( ( X5 @ two @ three )
!= five )
| ( ( X5 @ one @ two )
!= three ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_23,plain,
! [X4: ( $i > $i ) > $i > $i,X3: ( $i > $i ) > $i > $i,X1: $i > $i] :
( ( mult @ X3 @ X4 @ X1 )
= ( X3 @ ( X4 @ X1 ) ) ),
inference(rw,[status(thm)],[inference(pos_ext,[status(thm)],[c_0_18]),c_0_19]) ).
thf(c_0_24,plain,
! [X32: ( $i > $i ) > $i > $i,X33: ( $i > $i ) > $i > $i,X34: $i > $i,X35: $i] :
( ( plus @ X32 @ X33 @ X34 @ X35 )
= ( X32 @ X34 @ ( X33 @ X34 @ X35 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[plus_ax])]) ).
thf(c_0_25,plain,
! [X1: $i > $i,X2: $i] :
( ( three @ X1 @ X2 )
= ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,plain,
! [X1: $i > $i,X2: $i] :
( ( one @ X1 @ ( X1 @ X2 ) )
= ( two @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
thf(c_0_27,plain,
! [X1: $i > $i,X2: $i] :
( ( two @ X1 @ X2 )
= ( X1 @ ( one @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
thf(c_0_28,negated_conjecture,
! [X5: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i] :
( ( ( X5 @ one @ two @ ( esk1_2 @ X5 ) )
!= ( three @ ( esk1_2 @ X5 ) ) )
| ( ( X5 @ two @ three )
!= five ) ),
inference(neg_ext,[status(thm)],[c_0_22]) ).
thf(c_0_29,plain,
! [X3: ( $i > $i ) > $i > $i,X1: $i > $i] :
( ( mult @ one @ X3 @ X1 )
= ( X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
thf(c_0_30,plain,
! [X65: ( $i > $i ) > $i > $i,X66: ( $i > $i ) > $i > $i,X67: $i > $i,X68: $i] :
( ( plus @ X65 @ X66 @ X67 @ X68 )
= ( X65 @ X67 @ ( X66 @ X67 @ X68 ) ) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
thf(c_0_31,plain,
! [X1: $i > $i,X2: $i] :
( ( three @ X1 @ X2 )
= ( X1 @ ( two @ X1 @ X2 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_19]),c_0_21]),c_0_19]) ).
thf(c_0_32,plain,
! [X1: $i > $i,X2: $i] :
( ( one @ X1 @ ( two @ X1 @ X2 ) )
= ( two @ X1 @ ( one @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_33,plain,
! [X17: $i > $i,X18: $i] :
( ( five @ X17 @ X18 )
= ( X17 @ ( X17 @ ( X17 @ ( X17 @ ( X17 @ X18 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[five_ax])]) ).
thf(c_0_34,negated_conjecture,
! [X5: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i] :
( ( ( mult @ one @ ( X5 @ one @ two ) @ ( esk1_2 @ X5 ) )
!= ( three @ ( esk1_2 @ X5 ) ) )
| ( ( X5 @ two @ three )
!= five ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_35,plain,
! [X1: $i > $i,X3: ( $i > $i ) > $i > $i,X4: ( $i > $i ) > $i > $i,X2: $i] :
( ( plus @ X3 @ X4 @ X1 @ X2 )
= ( X3 @ X1 @ ( X4 @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_36,plain,
! [X1: $i > $i,X2: $i] :
( ( two @ X1 @ ( one @ X1 @ X2 ) )
= ( three @ X1 @ X2 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_31]),c_0_32]) ).
thf(c_0_37,plain,
! [X50: $i > $i,X51: $i] :
( ( five @ X50 @ X51 )
= ( X50 @ ( X50 @ ( X50 @ ( X50 @ ( X50 @ X51 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
thf(c_0_38,negated_conjecture,
! [X5: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i] :
( ( ( one @ ( mult @ one @ ( X5 @ one @ two ) @ ( esk1_2 @ X5 ) ) @ ( esk496_1 @ X5 ) )
!= ( esk1_2 @ X5 @ ( esk1_2 @ X5 @ ( esk1_2 @ X5 @ ( esk496_1 @ X5 ) ) ) ) )
| ( ( X5 @ two @ three )
!= five ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_34]),c_0_14]),c_0_25]) ).
thf(c_0_39,plain,
! [X1: $i > $i,X3: ( $i > $i ) > $i > $i,X4: ( $i > $i ) > $i > $i,X2: $i] :
( ( one @ ( mult @ one @ ( plus @ X3 @ X4 ) @ X1 ) @ X2 )
= ( X3 @ X1 @ ( X4 @ X1 @ X2 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_14]),c_0_18]) ).
thf(c_0_40,plain,
! [X1: $i > $i,X2: $i] :
( ( one @ X1 @ ( two @ X1 @ X2 ) )
= ( three @ X1 @ X2 ) ),
inference(rw,[status(thm)],[c_0_32,c_0_36]) ).
thf(c_0_41,plain,
! [X1: $i > $i,X2: $i] :
( ( five @ X1 @ X2 )
= ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_42,negated_conjecture,
( ( plus @ two @ three )
!= five ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_25]) ).
thf(c_0_43,plain,
! [X1: $i > $i,X2: $i] :
( ( one @ ( five @ X1 ) @ X2 )
= ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ),
inference(rw,[status(thm)],[c_0_41,c_0_14]) ).
thf(c_0_44,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(neg_ext,[status(thm)],[c_0_42]),c_0_14]),c_0_29]),c_0_39]),c_0_25]),c_0_21]),c_0_14]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM021^1 : TPTP v8.2.0. Released v3.6.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 07:24:52 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running higher-order theorem proving
% 0.16/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.20/0.85 # Version: 3.1.0-ho
% 3.20/0.85 # Preprocessing class: HSSSSMSSMSSNHHA.
% 3.20/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.20/0.85 # Starting new_ho_10 with 1500s (5) cores
% 3.20/0.85 # Starting ho_unfolding_6 with 300s (1) cores
% 3.20/0.85 # Starting sh4l with 300s (1) cores
% 3.20/0.85 # Starting ehoh_best_nonlift with 300s (1) cores
% 3.20/0.85 # new_ho_10 with pid 2269 completed with status 0
% 3.20/0.85 # Result found by new_ho_10
% 3.20/0.85 # Preprocessing class: HSSSSMSSMSSNHHA.
% 3.20/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.20/0.85 # Starting new_ho_10 with 1500s (5) cores
% 3.20/0.85 # No SInE strategy applied
% 3.20/0.85 # Search class: HUHPM-FFSF32-DHHSFMNN
% 3.20/0.85 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 3.20/0.85 # Starting new_ho_10 with 901s (1) cores
% 3.20/0.85 # Starting ho_unfolding_6 with 151s (1) cores
% 3.20/0.85 # Starting sh4l with 151s (1) cores
% 3.20/0.85 # Starting ehoh_best_nonlift with 151s (1) cores
% 3.20/0.85 # Starting new_bool_11 with 146s (1) cores
% 3.20/0.85 # new_bool_11 with pid 2280 completed with status 0
% 3.20/0.85 # Result found by new_bool_11
% 3.20/0.85 # Preprocessing class: HSSSSMSSMSSNHHA.
% 3.20/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.20/0.85 # Starting new_ho_10 with 1500s (5) cores
% 3.20/0.85 # No SInE strategy applied
% 3.20/0.85 # Search class: HUHPM-FFSF32-DHHSFMNN
% 3.20/0.85 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 3.20/0.85 # Starting new_ho_10 with 901s (1) cores
% 3.20/0.85 # Starting ho_unfolding_6 with 151s (1) cores
% 3.20/0.85 # Starting sh4l with 151s (1) cores
% 3.20/0.85 # Starting ehoh_best_nonlift with 151s (1) cores
% 3.20/0.85 # Starting new_bool_11 with 146s (1) cores
% 3.20/0.85 # Preprocessing time : 0.001 s
% 3.20/0.85 # Presaturation interreduction done
% 3.20/0.85
% 3.20/0.85 # Proof found!
% 3.20/0.85 # SZS status Theorem
% 3.20/0.85 # SZS output start CNFRefutation
% See solution above
% 3.20/0.85 # Parsed axioms : 29
% 3.20/0.85 # Removed by relevancy pruning/SinE : 0
% 3.20/0.85 # Initial clauses : 29
% 3.20/0.85 # Removed in clause preprocessing : 14
% 3.20/0.85 # Initial clauses in saturation : 15
% 3.20/0.85 # Processed clauses : 861
% 3.20/0.85 # ...of these trivial : 197
% 3.20/0.85 # ...subsumed : 209
% 3.20/0.85 # ...remaining for further processing : 454
% 3.20/0.85 # Other redundant clauses eliminated : 261
% 3.20/0.85 # Clauses deleted for lack of memory : 0
% 3.20/0.85 # Backward-subsumed : 0
% 3.20/0.85 # Backward-rewritten : 127
% 3.20/0.85 # Generated clauses : 10628
% 3.20/0.85 # ...of the previous two non-redundant : 9925
% 3.20/0.85 # ...aggressively subsumed : 0
% 3.20/0.85 # Contextual simplify-reflections : 0
% 3.20/0.85 # Paramodulations : 9447
% 3.20/0.85 # Factorizations : 0
% 3.20/0.85 # NegExts : 641
% 3.20/0.85 # Equation resolutions : 261
% 3.20/0.85 # Disequality decompositions : 0
% 3.20/0.85 # Total rewrite steps : 15867
% 3.20/0.85 # ...of those cached : 14348
% 3.20/0.85 # Propositional unsat checks : 0
% 3.20/0.85 # Propositional check models : 0
% 3.20/0.85 # Propositional check unsatisfiable : 0
% 3.20/0.85 # Propositional clauses : 0
% 3.20/0.85 # Propositional clauses after purity: 0
% 3.20/0.85 # Propositional unsat core size : 0
% 3.20/0.85 # Propositional preprocessing time : 0.000
% 3.20/0.85 # Propositional encoding time : 0.000
% 3.20/0.85 # Propositional solver time : 0.000
% 3.20/0.85 # Success case prop preproc time : 0.000
% 3.20/0.85 # Success case prop encoding time : 0.000
% 3.20/0.85 # Success case prop solver time : 0.000
% 3.20/0.85 # Current number of processed clauses : 312
% 3.20/0.85 # Positive orientable unit clauses : 25
% 3.20/0.85 # Positive unorientable unit clauses: 48
% 3.20/0.85 # Negative unit clauses : 2
% 3.20/0.85 # Non-unit-clauses : 237
% 3.20/0.85 # Current number of unprocessed clauses: 8963
% 3.20/0.85 # ...number of literals in the above : 12259
% 3.20/0.85 # Current number of archived formulas : 0
% 3.20/0.85 # Current number of archived clauses : 142
% 3.20/0.85 # Clause-clause subsumption calls (NU) : 54390
% 3.20/0.85 # Rec. Clause-clause subsumption calls : 8834
% 3.20/0.85 # Non-unit clause-clause subsumptions : 132
% 3.20/0.85 # Unit Clause-clause subsumption calls : 724
% 3.20/0.85 # Rewrite failures with RHS unbound : 0
% 3.20/0.85 # BW rewrite match attempts : 13230
% 3.20/0.85 # BW rewrite match successes : 869
% 3.20/0.85 # Condensation attempts : 861
% 3.20/0.85 # Condensation successes : 0
% 3.20/0.85 # Termbank termtop insertions : 633191
% 3.20/0.85 # Search garbage collected termcells : 98
% 3.20/0.85
% 3.20/0.85 # -------------------------------------------------
% 3.20/0.85 # User time : 0.377 s
% 3.20/0.85 # System time : 0.012 s
% 3.20/0.85 # Total time : 0.389 s
% 3.20/0.85 # Maximum resident set size: 1844 pages
% 3.20/0.85
% 3.20/0.85 # -------------------------------------------------
% 3.20/0.85 # User time : 1.872 s
% 3.20/0.85 # System time : 0.076 s
% 3.20/0.85 # Total time : 1.948 s
% 3.20/0.85 # Maximum resident set size: 1752 pages
% 3.20/0.85 % E---3.1 exiting
% 3.20/0.85 % E exiting
%------------------------------------------------------------------------------