%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV406+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 02:54:40 PM UTC 2026
% Result : Theorem 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 8 unt; 0 def)
% Number of atoms : 154 ( 16 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 162 ( 59 ~; 71 |; 15 &)
% ( 9 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 137 ( 20 sgn 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l42_co,conjecture,
! [X1] :
( ! [X2,X3] :
( check_cpq(triple(X2,X1,X3))
<=> ! [X4,X5] :
( pair_in_list(X1,X4,X5)
=> less_than(X5,X4) ) )
=> ! [X6,X7,X8,X9] :
( check_cpq(triple(X6,insert_slb(X1,pair(X8,X9)),X7))
<=> ! [X10,X11] :
( pair_in_list(insert_slb(X1,pair(X8,X9)),X10,X11)
=> less_than(X11,X10) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l42_co) ).
fof(ax23,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( ( X4 = X5
& X2 = X3 )
| pair_in_list(X1,X3,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(ax38,axiom,
! [X1,X2,X3,X4,X5] :
( strictly_less_than(X4,X5)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> ~ $true ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax38) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax37,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax37) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ! [X2,X3] :
( check_cpq(triple(X2,X1,X3))
<=> ! [X4,X5] :
( pair_in_list(X1,X4,X5)
=> less_than(X5,X4) ) )
=> ! [X6,X7,X8,X9] :
( check_cpq(triple(X6,insert_slb(X1,pair(X8,X9)),X7))
<=> ! [X10,X11] :
( pair_in_list(insert_slb(X1,pair(X8,X9)),X10,X11)
=> less_than(X11,X10) ) ) ),
inference(assume_negation,[status(cth)],[l42_co]) ).
fof(c_0_7,plain,
! [X31,X32,X33,X34,X35] :
( ( pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35)
| X34 != X35
| X32 != X33 )
& ( pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35)
| ~ pair_in_list(X31,X33,X35) )
& ( ~ pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35)
| pair_in_list(X31,X33,X35)
| X34 = X35 )
& ( ~ pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35)
| pair_in_list(X31,X33,X35)
| X32 = X33 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
fof(c_0_8,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_9,negated_conjecture,
! [X126,X127,X128,X129,X138,X139] :
( ( less_than(X139,X138)
| ~ pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X138,X139)
| check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) )
& ( ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| ~ less_than(esk9_0,esk8_0) )
& ( ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0) )
& ( check_cpq(triple(X126,esk1_0,X127))
| ~ less_than(esk3_2(X126,X127),esk2_2(X126,X127)) )
& ( check_cpq(triple(X126,esk1_0,X127))
| pair_in_list(esk1_0,esk2_2(X126,X127),esk3_2(X126,X127)) )
& ( less_than(X129,X128)
| ~ pair_in_list(esk1_0,X128,X129)
| ~ check_cpq(triple(X126,esk1_0,X127)) ) ),
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_6])])])])])]) ).
fof(c_0_10,plain,
! [X77,X78,X79,X80,X81] :
( ( ~ strictly_less_than(X80,X81)
| check_cpq(triple(X77,insert_slb(X78,pair(X80,X81)),X79))
| $true )
& ( ~ strictly_less_than(X80,X81)
| ~ $true
| ~ check_cpq(triple(X77,insert_slb(X78,pair(X80,X81)),X79)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax38])])])]) ).
cnf(c_0_11,plain,
( X3 != X4
| X1 != X2
| pair_in_list(insert_slb(X5,pair(X1,X3)),X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X18,X19] :
( ( strictly_less_than(X18,X19)
| less_than(X19,X18)
| ~ less_than(X18,X19) )
& ( ~ strictly_less_than(X18,X19)
| ~ less_than(X19,X18) )
& ( ~ strictly_less_than(X18,X19)
| less_than(X18,X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_13,plain,
! [X15,X16] :
( less_than(X16,X15)
| less_than(X15,X16) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_14,negated_conjecture,
( ~ pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X1,X2)
| less_than(X2,X1)
| check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ pair_in_list(X1,X2,X3)
| pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( ~ strictly_less_than(X3,X4)
| $false
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])]) ).
cnf(c_0_18,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X72,X73,X74,X75,X76] :
( ( ~ less_than(X76,X75)
| check_cpq(triple(X72,insert_slb(X73,pair(X75,X76)),X74))
| ~ check_cpq(triple(X72,X73,X74)) )
& ( ~ less_than(X76,X75)
| check_cpq(triple(X72,X73,X74))
| ~ check_cpq(triple(X72,insert_slb(X73,pair(X75,X76)),X74)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ pair_in_list(esk1_0,X2,X1)
| less_than(X1,X2)
| check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| pair_in_list(esk1_0,esk2_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ less_than(esk3_2(X1,X2),esk2_2(X1,X2))
| check_cpq(triple(X1,esk1_0,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ strictly_less_than(X3,X4) ),
inference(cn,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( less_than(esk7_0,esk6_0)
| check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_26,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( ~ less_than(X4,X3)
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| check_cpq(triple(X1,X2,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
less_than(esk7_0,esk6_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,plain,
( ~ less_than(X5,X4)
| ~ check_cpq(triple(X1,X2,X3))
| check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| check_cpq(triple(esk4_0,esk1_0,esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,plain,
( ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4)
| pair_in_list(X3,X2,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_34,negated_conjecture,
( ~ check_cpq(triple(esk4_0,esk1_0,esk5_0))
| pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
( ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| ~ less_than(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_36,negated_conjecture,
( ~ pair_in_list(esk1_0,X3,X4)
| ~ check_cpq(triple(X1,esk1_0,X2))
| less_than(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,negated_conjecture,
check_cpq(triple(esk4_0,esk1_0,esk5_0)),
inference(ef,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( ~ check_cpq(triple(esk4_0,esk1_0,esk5_0))
| pair_in_list(esk1_0,esk8_0,esk9_0)
| esk8_0 = esk6_0 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( ~ less_than(esk9_0,esk8_0)
| ~ check_cpq(triple(esk4_0,esk1_0,esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
( ~ less_than(esk9_0,esk8_0)
| check_cpq(triple(X1,esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_41,plain,
( ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2)
| pair_in_list(X3,X4,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_42,negated_conjecture,
( ~ pair_in_list(esk1_0,X2,X1)
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( pair_in_list(esk1_0,esk8_0,esk9_0)
| esk8_0 = esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
~ less_than(esk9_0,esk8_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( ~ check_cpq(triple(esk4_0,esk1_0,esk5_0))
| pair_in_list(esk1_0,esk8_0,esk9_0)
| esk9_0 = esk7_0 ),
inference(spm,[status(thm)],[c_0_41,c_0_34]) ).
cnf(c_0_46,negated_conjecture,
esk8_0 = esk6_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( pair_in_list(esk1_0,esk6_0,esk9_0)
| esk9_0 = esk7_0 ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_37])]),c_0_46]) ).
cnf(c_0_48,negated_conjecture,
~ less_than(esk9_0,esk6_0),
inference(rw,[status(thm)],[c_0_44,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
esk9_0 = esk7_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_47]),c_0_48]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV406+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:40:27 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1927053 completed with status 0
% 0.14/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.45 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1927066 completed with status 0
% 0.14/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.45 % Preprocessing time : 0.002 s
% 0.14/0.45 % Presaturation interreduction done
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 42
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 58
% 0.14/0.45 % Removed in clause preprocessing : 4
% 0.14/0.45 % Initial clauses in saturation : 54
% 0.14/0.45 % Processed clauses : 277
% 0.14/0.45 % ...of these trivial : 3
% 0.14/0.45 % ...subsumed : 74
% 0.14/0.45 % ...remaining for further processing : 200
% 0.14/0.45 % Other redundant clauses eliminated : 3
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 12
% 0.14/0.45 % Backward-rewritten : 32
% 0.14/0.45 % Generated clauses : 630
% 0.14/0.45 % ...of the previous two non-redundant : 526
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 5
% 0.14/0.45 % Paramodulations : 614
% 0.14/0.45 % Factorizations : 14
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 3
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 163
% 0.14/0.45 % ...of those cached : 127
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 100
% 0.14/0.45 % Positive orientable unit clauses : 20
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 11
% 0.14/0.45 % Non-unit-clauses : 69
% 0.14/0.45 % Current number of unprocessed clauses: 348
% 0.14/0.45 % ...number of literals in the above : 1332
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 100
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 2164
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 1704
% 0.14/0.45 % Non-unit clause-clause subsumptions : 78
% 0.14/0.45 % Unit Clause-clause subsumption calls : 484
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 19
% 0.14/0.45 % BW rewrite match successes : 5
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 12814
% 0.14/0.45 % Search garbage collected termcells : 799
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.027 s
% 0.14/0.45 % System time : 0.006 s
% 0.14/0.45 % Total time : 0.033 s
% 0.14/0.45 % Maximum resident set size: 3692 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.130 s
% 0.14/0.45 % System time : 0.020 s
% 0.14/0.45 % Total time : 0.151 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------