TSTP Solution File: LCL654+1.001 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL654+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:29:30 EDT 2023
% Result : Theorem 0.16s 0.51s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of formulae : 36 ( 9 unt; 0 def)
% Number of atoms : 228 ( 0 equ)
% Maximal formula atoms : 50 ( 6 avg)
% Number of connectives : 388 ( 196 ~; 173 |; 19 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 113 ( 0 sgn; 54 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ $true ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sJYTSxZnV6/E---3.1_10248.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.sJYTSxZnV6/E---3.1_10248.p',reflexivity) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] : ~ r1(X2,X1) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(c_0_3,negated_conjecture,
! [X4,X5,X7,X8,X9,X11,X12,X13,X15,X16,X18,X23] :
( ( r1(X5,esk2_2(X4,X5))
| ~ r1(X4,X5)
| ~ p1(X4)
| ~ r1(esk1_0,X4) )
& ( p1(esk2_2(X4,X5))
| ~ r1(X4,X5)
| ~ p1(X4)
| ~ r1(esk1_0,X4) )
& ( r1(X9,esk3_3(X7,X8,X9))
| ~ r1(X8,X9)
| ~ r1(X8,X11)
| p1(X11)
| ~ r1(X7,X8)
| ~ r1(esk1_0,X7) )
& ( ~ p1(esk3_3(X7,X8,X9))
| ~ r1(X8,X9)
| ~ r1(X8,X11)
| p1(X11)
| ~ r1(X7,X8)
| ~ r1(esk1_0,X7) )
& ( r1(X16,esk5_2(X12,X16))
| ~ r1(X12,X16)
| r1(X13,esk4_2(X12,X13))
| ~ r1(X12,X13)
| ~ r1(esk1_0,X12) )
& ( ~ p1(esk5_2(X12,X16))
| ~ r1(X12,X16)
| r1(X13,esk4_2(X12,X13))
| ~ r1(X12,X13)
| ~ r1(esk1_0,X12) )
& ( r1(X16,esk5_2(X12,X16))
| ~ r1(X12,X16)
| ~ r1(esk4_2(X12,X13),X15)
| p1(X15)
| ~ r1(X12,X13)
| ~ r1(esk1_0,X12) )
& ( ~ p1(esk5_2(X12,X16))
| ~ r1(X12,X16)
| ~ r1(esk4_2(X12,X13),X15)
| p1(X15)
| ~ r1(X12,X13)
| ~ r1(esk1_0,X12) )
& ( ~ r1(esk1_0,X18)
| r1(X18,esk6_1(X18)) )
& r1(esk1_0,esk7_0)
& r1(esk7_0,esk8_0)
& r1(esk8_0,esk9_0)
& ~ p1(esk9_0)
& ( ~ r1(esk7_0,X23)
| p1(X23) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_4,negated_conjecture,
( r1(X1,esk5_2(X2,X1))
| r1(X3,esk4_2(X2,X3))
| ~ r1(X2,X1)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
r1(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( r1(X1,esk3_3(X2,X3,X1))
| p1(X4)
| ~ r1(X3,X1)
| ~ r1(X3,X4)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
r1(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
~ p1(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( r1(X1,esk5_2(esk7_0,X1))
| r1(X2,esk4_2(esk7_0,X2))
| ~ r1(esk7_0,X2)
| ~ r1(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
r1(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_11,plain,
! [X24] : r1(X24,X24),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_12,negated_conjecture,
( r1(X1,esk5_2(X2,X1))
| p1(X4)
| ~ r1(X2,X1)
| ~ r1(esk4_2(X2,X3),X4)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( r1(X1,esk3_3(X2,esk8_0,X1))
| ~ r1(esk1_0,X2)
| ~ r1(esk8_0,X1)
| ~ r1(X2,esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( r1(esk8_0,esk4_2(esk7_0,esk8_0))
| r1(X1,esk5_2(esk7_0,X1))
| ~ r1(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( p1(esk3_3(X1,esk8_0,esk4_2(X2,X3)))
| r1(X4,esk5_2(X2,X4))
| ~ r1(esk8_0,esk4_2(X2,X3))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(X1,esk8_0)
| ~ r1(X2,X3)
| ~ r1(X2,X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( r1(esk7_0,esk5_2(esk7_0,esk7_0))
| r1(esk8_0,esk4_2(esk7_0,esk8_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( p1(esk3_3(X1,esk8_0,esk4_2(esk7_0,esk8_0)))
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| r1(X2,esk5_2(esk7_0,X2))
| ~ r1(esk1_0,X1)
| ~ r1(X1,esk8_0)
| ~ r1(esk7_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_5]),c_0_10])]) ).
cnf(c_0_19,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| r1(X1,esk5_2(esk7_0,X1))
| ~ r1(esk7_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_5]),c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
( p1(X4)
| ~ p1(esk5_2(X1,X2))
| ~ r1(X1,X2)
| ~ r1(esk4_2(X1,X3),X4)
| ~ r1(X1,X3)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_21,negated_conjecture,
( p1(X4)
| ~ p1(esk3_3(X1,X2,X3))
| ~ r1(X2,X3)
| ~ r1(X2,X4)
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_22,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
| r1(esk7_0,esk5_2(esk7_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( p1(esk3_3(X1,esk8_0,esk4_2(X2,X3)))
| ~ p1(esk5_2(X2,X4))
| ~ r1(esk8_0,esk4_2(X2,X3))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(X1,esk8_0)
| ~ r1(X2,X3)
| ~ r1(X2,X4) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( p1(X1)
| ~ r1(esk7_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_25,negated_conjecture,
( p1(X1)
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| ~ r1(esk8_0,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_5]),c_0_10])]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( p1(esk3_3(X1,esk8_0,esk4_2(X2,X3)))
| ~ r1(esk8_0,esk4_2(X2,X3))
| ~ r1(esk7_0,esk5_2(X2,X4))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(X1,esk8_0)
| ~ r1(X2,X3)
| ~ r1(X2,X4) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
r1(esk7_0,esk5_2(esk7_0,esk7_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_7]),c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( r1(X3,esk4_2(X1,X3))
| ~ p1(esk5_2(X1,X2))
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_29,negated_conjecture,
( p1(esk3_3(X1,esk8_0,esk4_2(esk7_0,X2)))
| ~ r1(esk8_0,esk4_2(esk7_0,X2))
| ~ r1(esk1_0,X1)
| ~ r1(X1,esk8_0)
| ~ r1(esk7_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_5]),c_0_15])]) ).
cnf(c_0_30,negated_conjecture,
( r1(X1,esk4_2(X2,X1))
| ~ r1(esk7_0,esk5_2(X2,X3))
| ~ r1(esk1_0,X2)
| ~ r1(X2,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,esk4_2(esk7_0,X2))
| ~ r1(esk1_0,X3)
| ~ r1(esk8_0,X1)
| ~ r1(X3,esk8_0)
| ~ r1(esk7_0,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( r1(X1,esk4_2(esk7_0,X1))
| ~ r1(esk7_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_5]),c_0_15])]) ).
cnf(c_0_33,negated_conjecture,
( p1(X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk8_0,X1)
| ~ r1(X2,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_10])]) ).
cnf(c_0_34,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_5]),c_0_10])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_34]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL654+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n001.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 12:47:51 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.sJYTSxZnV6/E---3.1_10248.p
% 0.16/0.51 # Version: 3.1pre001
% 0.16/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.51 # Starting sh5l with 300s (1) cores
% 0.16/0.51 # sh5l with pid 10328 completed with status 0
% 0.16/0.51 # Result found by sh5l
% 0.16/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.51 # Starting sh5l with 300s (1) cores
% 0.16/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.51 # Search class: FGUNF-FFSS32-SFFFFFNN
% 0.16/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.51 # SAT001_MinMin_p005000_rr_RG with pid 10334 completed with status 0
% 0.16/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.51 # Starting sh5l with 300s (1) cores
% 0.16/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.51 # Search class: FGUNF-FFSS32-SFFFFFNN
% 0.16/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.51 # Preprocessing time : 0.001 s
% 0.16/0.51 # Presaturation interreduction done
% 0.16/0.51
% 0.16/0.51 # Proof found!
% 0.16/0.51 # SZS status Theorem
% 0.16/0.51 # SZS output start CNFRefutation
% See solution above
% 0.16/0.51 # Parsed axioms : 2
% 0.16/0.51 # Removed by relevancy pruning/SinE : 0
% 0.16/0.51 # Initial clauses : 15
% 0.16/0.51 # Removed in clause preprocessing : 0
% 0.16/0.51 # Initial clauses in saturation : 15
% 0.16/0.51 # Processed clauses : 301
% 0.16/0.51 # ...of these trivial : 0
% 0.16/0.51 # ...subsumed : 22
% 0.16/0.51 # ...remaining for further processing : 279
% 0.16/0.51 # Other redundant clauses eliminated : 0
% 0.16/0.51 # Clauses deleted for lack of memory : 0
% 0.16/0.51 # Backward-subsumed : 27
% 0.16/0.51 # Backward-rewritten : 51
% 0.16/0.51 # Generated clauses : 985
% 0.16/0.51 # ...of the previous two non-redundant : 970
% 0.16/0.51 # ...aggressively subsumed : 0
% 0.16/0.51 # Contextual simplify-reflections : 4
% 0.16/0.51 # Paramodulations : 985
% 0.16/0.51 # Factorizations : 0
% 0.16/0.51 # NegExts : 0
% 0.16/0.51 # Equation resolutions : 0
% 0.16/0.51 # Total rewrite steps : 290
% 0.16/0.51 # Propositional unsat checks : 0
% 0.16/0.51 # Propositional check models : 0
% 0.16/0.51 # Propositional check unsatisfiable : 0
% 0.16/0.51 # Propositional clauses : 0
% 0.16/0.51 # Propositional clauses after purity: 0
% 0.16/0.51 # Propositional unsat core size : 0
% 0.16/0.51 # Propositional preprocessing time : 0.000
% 0.16/0.51 # Propositional encoding time : 0.000
% 0.16/0.51 # Propositional solver time : 0.000
% 0.16/0.51 # Success case prop preproc time : 0.000
% 0.16/0.51 # Success case prop encoding time : 0.000
% 0.16/0.51 # Success case prop solver time : 0.000
% 0.16/0.51 # Current number of processed clauses : 186
% 0.16/0.51 # Positive orientable unit clauses : 13
% 0.16/0.51 # Positive unorientable unit clauses: 0
% 0.16/0.51 # Negative unit clauses : 3
% 0.16/0.51 # Non-unit-clauses : 170
% 0.16/0.51 # Current number of unprocessed clauses: 598
% 0.16/0.51 # ...number of literals in the above : 4236
% 0.16/0.51 # Current number of archived formulas : 0
% 0.16/0.51 # Current number of archived clauses : 93
% 0.16/0.51 # Clause-clause subsumption calls (NU) : 7990
% 0.16/0.51 # Rec. Clause-clause subsumption calls : 1517
% 0.16/0.51 # Non-unit clause-clause subsumptions : 43
% 0.16/0.51 # Unit Clause-clause subsumption calls : 161
% 0.16/0.51 # Rewrite failures with RHS unbound : 0
% 0.16/0.51 # BW rewrite match attempts : 15
% 0.16/0.51 # BW rewrite match successes : 9
% 0.16/0.51 # Condensation attempts : 0
% 0.16/0.51 # Condensation successes : 0
% 0.16/0.51 # Termbank termtop insertions : 30339
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.054 s
% 0.16/0.51 # System time : 0.002 s
% 0.16/0.51 # Total time : 0.056 s
% 0.16/0.51 # Maximum resident set size: 1752 pages
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.054 s
% 0.16/0.51 # System time : 0.005 s
% 0.16/0.51 # Total time : 0.059 s
% 0.16/0.51 # Maximum resident set size: 1676 pages
% 0.16/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------