%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL654+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:15:14 PM UTC 2026
% Result : Theorem 0.24s 0.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 222 ( 0 equ)
% Maximal formula atoms : 52 ( 6 avg)
% Number of connectives : 392 ( 207 ~; 162 |; 23 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 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 : 114 ( 0 sgn 74 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ! [X1] :
( ~ ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ! [X1] :
( ~ ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ! [X1] :
( ~ ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_4,negated_conjecture,
! [X5,X6,X8,X9,X10,X12,X13,X14,X16,X17,X19,X24] :
( ( p1(X24)
| ~ r1(esk7_0,X24) )
& ~ p1(esk9_0)
& r1(esk8_0,esk9_0)
& r1(esk7_0,esk8_0)
& r1(esk1_0,esk7_0)
& ( ~ r1(esk1_0,X19)
| $true )
& ( ~ r1(esk1_0,X19)
| r1(X19,esk6_1(X19)) )
& ( ~ r1(esk1_0,X13)
| ~ r1(X13,X14)
| p1(X16)
| ~ r1(esk4_2(X13,X14),X16)
| ~ r1(X13,X17)
| ~ p1(esk5_2(X13,X17)) )
& ( ~ r1(esk1_0,X13)
| ~ r1(X13,X14)
| p1(X16)
| ~ r1(esk4_2(X13,X14),X16)
| ~ r1(X13,X17)
| r1(X17,esk5_2(X13,X17)) )
& ( ~ r1(esk1_0,X13)
| ~ r1(X13,X14)
| r1(X14,esk4_2(X13,X14))
| ~ r1(X13,X17)
| ~ p1(esk5_2(X13,X17)) )
& ( ~ r1(esk1_0,X13)
| ~ r1(X13,X14)
| r1(X14,esk4_2(X13,X14))
| ~ r1(X13,X17)
| r1(X17,esk5_2(X13,X17)) )
& ( ~ r1(esk1_0,X8)
| ~ r1(X8,X9)
| p1(X12)
| ~ r1(X9,X12)
| ~ r1(X9,X10)
| ~ p1(esk3_3(X8,X9,X10)) )
& ( ~ r1(esk1_0,X8)
| ~ r1(X8,X9)
| p1(X12)
| ~ r1(X9,X12)
| ~ r1(X9,X10)
| r1(X10,esk3_3(X8,X9,X10)) )
& ( ~ r1(esk1_0,X5)
| ~ p1(X5)
| ~ r1(X5,X6)
| p1(esk2_2(X5,X6)) )
& ( ~ r1(esk1_0,X5)
| ~ p1(X5)
| ~ r1(X5,X6)
| r1(X6,esk2_2(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ r1(esk1_0,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X3,X1)
| p1(X4)
| r1(X1,esk3_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
r1(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ p1(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( ~ r1(esk1_0,X2)
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| r1(X3,esk4_2(X2,X3))
| r1(X1,esk5_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
r1(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
r1(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X3] : r1(X3,X3),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_12,negated_conjecture,
( ~ r1(esk1_0,X2)
| ~ r1(X2,X3)
| ~ r1(esk4_2(X2,X3),X4)
| ~ r1(X2,X1)
| p1(X4)
| r1(X1,esk5_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1(X2,esk8_0)
| ~ r1(esk8_0,X1)
| ~ r1(esk1_0,X2)
| r1(X1,esk3_3(X2,esk8_0,X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ r1(esk7_0,X1)
| r1(X1,esk5_2(esk7_0,X1))
| r1(esk8_0,esk4_2(esk7_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,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,
( ~ r1(esk7_0,X2)
| ~ r1(esk4_2(esk7_0,esk8_0),X1)
| r1(X2,esk5_2(esk7_0,X2))
| p1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_9]),c_0_10])]) ).
cnf(c_0_17,negated_conjecture,
( ~ r1(esk8_0,X1)
| r1(X1,esk3_3(esk7_0,esk8_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_9])]) ).
cnf(c_0_18,negated_conjecture,
( r1(esk8_0,esk4_2(esk7_0,esk8_0))
| r1(esk7_0,esk5_2(esk7_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( ~ r1(esk4_2(esk7_0,esk8_0),X1)
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| p1(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( r1(esk7_0,esk5_2(esk7_0,esk7_0))
| r1(esk4_2(esk7_0,esk8_0),esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X4)
| ~ r1(X2,X3)
| ~ p1(esk3_3(X1,X2,X3))
| p1(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( r1(esk7_0,esk5_2(esk7_0,esk7_0))
| p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( ~ r1(esk8_0,X1)
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| p1(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_10]),c_0_9])]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ r1(esk7_0,X1)
| p1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_25,negated_conjecture,
r1(esk7_0,esk5_2(esk7_0,esk7_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_6]),c_0_7]) ).
cnf(c_0_26,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X3)
| ~ r1(X1,X2)
| ~ p1(esk5_2(X1,X2))
| r1(X3,esk4_2(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_27,negated_conjecture,
p1(esk5_2(esk7_0,esk7_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X3)
| ~ r1(esk4_2(X1,X3),X4)
| ~ r1(X1,X2)
| ~ p1(esk5_2(X1,X2))
| p1(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_29,negated_conjecture,
( ~ r1(esk7_0,X1)
| r1(X1,esk4_2(esk7_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_10]),c_0_15])]) ).
cnf(c_0_30,negated_conjecture,
( ~ r1(esk7_0,X2)
| ~ r1(esk4_2(esk7_0,X2),X1)
| p1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_10]),c_0_15])]) ).
cnf(c_0_31,negated_conjecture,
r1(esk8_0,esk4_2(esk7_0,esk8_0)),
inference(spm,[status(thm)],[c_0_29,c_0_9]) ).
cnf(c_0_32,negated_conjecture,
( ~ r1(esk4_2(esk7_0,esk8_0),X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_9]) ).
cnf(c_0_33,negated_conjecture,
r1(esk4_2(esk7_0,esk8_0),esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0))),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( ~ r1(esk8_0,X1)
| p1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_34]),c_0_10]),c_0_31]),c_0_9])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_6]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL654+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 % Computer : n015.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Mon Sep 21 00:49:51 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.48 Running first-order theorem proving
% 0.14/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.24/0.61 % Version: 3.5.1
% 0.24/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.61 % Starting sh5l with 300s (1) cores
% 0.24/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 196936 completed with status 0
% 0.24/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.61 % No SInE strategy applied
% 0.24/0.61 % Search class: FGUNF-FFSS32-SFFFFFNN
% 0.24/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.61 % new_bool_1 with pid 196947 completed with status 0
% 0.24/0.61 % Result found by new_bool_1
% 0.24/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.61 % No SInE strategy applied
% 0.24/0.61 % Search class: FGUNF-FFSS32-SFFFFFNN
% 0.24/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.61 % Preprocessing time : 0.002 s
% 0.24/0.61 % Presaturation interreduction done
% 0.24/0.61
% 0.24/0.61 % Proof found!
% 0.24/0.61 % SZS status Theorem
% 0.24/0.61 % SZS output start CNFRefutation
% See solution above
% 0.24/0.61 % Parsed axioms : 2
% 0.24/0.61 % Removed by relevancy pruning/SinE : 0
% 0.24/0.61 % Initial clauses : 16
% 0.24/0.61 % Removed in clause preprocessing : 1
% 0.24/0.61 % Initial clauses in saturation : 15
% 0.24/0.61 % Processed clauses : 229
% 0.24/0.61 % ...of these trivial : 0
% 0.24/0.61 % ...subsumed : 6
% 0.24/0.61 % ...remaining for further processing : 223
% 0.24/0.61 % Other redundant clauses eliminated : 0
% 0.24/0.61 % Clauses deleted for lack of memory : 0
% 0.24/0.61 % Backward-subsumed : 8
% 0.24/0.61 % Backward-rewritten : 14
% 0.24/0.61 % Generated clauses : 440
% 0.24/0.61 % ...of the previous two non-redundant : 383
% 0.24/0.61 % ...aggressively subsumed : 0
% 0.24/0.61 % Contextual simplify-reflections : 1
% 0.24/0.61 % Paramodulations : 440
% 0.24/0.61 % Factorizations : 0
% 0.24/0.61 % NegExts : 0
% 0.24/0.61 % Equation resolutions : 0
% 0.24/0.61 % Disequality decompositions : 0
% 0.24/0.61 % Total rewrite steps : 202
% 0.24/0.61 % ...of those cached : 177
% 0.24/0.61 % Propositional unsat checks : 0
% 0.24/0.61 % Propositional check models : 0
% 0.24/0.61 % Propositional check unsatisfiable : 0
% 0.24/0.61 % Propositional clauses : 0
% 0.24/0.61 % Propositional clauses after purity: 0
% 0.24/0.61 % Propositional unsat core size : 0
% 0.24/0.61 % Propositional preprocessing time : 0.000
% 0.24/0.61 % Propositional encoding time : 0.000
% 0.24/0.61 % Propositional solver time : 0.000
% 0.24/0.61 % Success case prop preproc time : 0.000
% 0.24/0.61 % Success case prop encoding time : 0.000
% 0.24/0.61 % Success case prop solver time : 0.000
% 0.24/0.61 % Current number of processed clauses : 186
% 0.24/0.61 % Positive orientable unit clauses : 42
% 0.24/0.61 % Positive unorientable unit clauses: 0
% 0.24/0.61 % Negative unit clauses : 1
% 0.24/0.61 % Non-unit-clauses : 143
% 0.24/0.61 % Current number of unprocessed clauses: 181
% 0.24/0.61 % ...number of literals in the above : 648
% 0.24/0.61 % Current number of archived formulas : 0
% 0.24/0.61 % Current number of archived clauses : 37
% 0.24/0.61 % Clause-clause subsumption calls (NU) : 2158
% 0.24/0.61 % Rec. Clause-clause subsumption calls : 1222
% 0.24/0.61 % Non-unit clause-clause subsumptions : 10
% 0.24/0.61 % Unit Clause-clause subsumption calls : 54
% 0.24/0.61 % Rewrite failures with RHS unbound : 0
% 0.24/0.61 % BW rewrite match attempts : 15
% 0.24/0.61 % BW rewrite match successes : 6
% 0.24/0.61 % Condensation attempts : 0
% 0.24/0.61 % Condensation successes : 0
% 0.24/0.61 % Termbank termtop insertions : 12436
% 0.24/0.61 % Search garbage collected termcells : 346
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.043 s
% 0.24/0.61 % System time : 0.003 s
% 0.24/0.61 % Total time : 0.046 s
% 0.24/0.61 % Maximum resident set size: 3632 pages
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.205 s
% 0.24/0.61 % System time : 0.024 s
% 0.24/0.61 % Total time : 0.229 s
% 0.24/0.61 % Maximum resident set size: 4608 pages
% 0.24/0.61 % E exiting
%------------------------------------------------------------------------------