%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC308+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:43:52 PM UTC 2026
% Result : Theorem 0.50s 0.65s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 53 ( 9 unt; 0 def)
% Number of atoms : 254 ( 101 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 323 ( 122 ~; 113 |; 52 &)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 45 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X4
& app(X10,cons(X9,nil)) != X3
& ssList(X10) )
& ssItem(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X2)
& ? [X8] :
( neq(nil,X2)
& hd(X2) = X8
& cons(X8,nil) = X7
& ssItem(X8) )
& app(X6,X7) = X5
& tl(X2) = X6
& ssList(X7) )
& ssList(X6) )
& X1 = X5
& ssList(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X4
& app(X10,cons(X9,nil)) != X3
& ssList(X10) )
& ssItem(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X2)
& ? [X8] :
( neq(nil,X2)
& hd(X2) = X8
& cons(X8,nil) = X7
& ssItem(X8) )
& app(X6,X7) = X5
& tl(X2) = X6
& ssList(X7) )
& ssList(X6) )
& X1 = X5
& ssList(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X4
& app(X10,cons(X9,nil)) != X3
& ssList(X10) )
& ssItem(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X2)
& ? [X8] :
( neq(nil,X2)
& hd(X2) = X8
& cons(X8,nil) = X7
& ssItem(X8) )
& app(X6,X7) = X5
& tl(X2) = X6
& ssList(X7) )
& ssList(X6) )
& X1 = X5
& ssList(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,negated_conjecture,
! [X259,X260,X261,X262,X263,X264] :
( ( nil != esk51_0
| nil = esk50_0 )
& ( app(cons(X263,nil),X264) != esk51_0
| app(X264,cons(X263,nil)) = esk50_0
| ~ ssList(X264)
| ~ ssItem(X263) )
& ( ~ neq(nil,esk49_0)
| ~ neq(nil,esk49_0)
| hd(esk49_0) != X262
| cons(X262,nil) != X261
| ~ ssItem(X262)
| app(X260,X261) != X259
| tl(esk49_0) != X260
| ~ ssList(X261)
| ~ ssList(X260)
| esk48_0 != X259
| ~ ssList(X259) )
& neq(esk49_0,nil)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
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_10])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ neq(nil,esk49_0)
| ~ neq(nil,esk49_0)
| hd(esk49_0) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(esk49_0) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| esk48_0 != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X134,X135] :
( ssList(app(X134,X135))
| ~ ssList(X135)
| ~ ssList(X134) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_14,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_15,negated_conjecture,
( ~ neq(nil,esk49_0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| tl(esk49_0) != X2
| hd(esk49_0) != X4
| esk48_0 != X1 ),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X131] :
( ssList(tl(X131))
| nil = X131
| ~ ssList(X131) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_19,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssItem(hd(esk49_0))
| ~ neq(nil,esk49_0)
| ~ ssList(tl(esk49_0))
| ~ ssList(cons(hd(esk49_0),nil))
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])])])])]),c_0_17]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X113,X114] :
( ( ~ ssList(X113)
| ~ ssList(X114)
| neq(X113,X114)
| X113 = X114 )
& ( ~ ssList(X113)
| ~ ssList(X114)
| X113 != X114
| ~ neq(X113,X114) ) ),
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_19])])])])]) ).
fof(c_0_24,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssItem(hd(esk49_0))
| ~ neq(nil,esk49_0)
| ~ ssList(cons(hd(esk49_0),nil))
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_28,plain,
! [X128] :
( ssItem(hd(X128))
| nil = X128
| ~ ssList(X128) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssItem(hd(esk49_0))
| ~ ssList(cons(hd(esk49_0),nil))
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22]),c_0_27])]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,plain,
! [X115,X116] :
( ssList(cons(X116,X115))
| ~ ssItem(X116)
| ~ ssList(X115) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_32,negated_conjecture,
( app(cons(X1,nil),X2) != esk51_0
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_34,plain,
! [X224,X225] :
( cons(X225,X224) = app(cons(X225,nil),X224)
| ~ ssItem(X225)
| ~ ssList(X224) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_35,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(cons(hd(esk49_0),nil))
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22])]) ).
cnf(c_0_37,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(cons(X2,nil),X1) != esk49_0
| app(X1,cons(X2,nil)) = esk50_0 ),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_40,plain,
! [X217] :
( cons(hd(X217),tl(X217)) = X217
| nil = X217
| ~ ssList(X217) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssItem(hd(esk49_0))
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_27])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) != esk49_0
| app(X1,cons(X2,nil)) = esk50_0 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_22])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssItem(hd(esk49_0))
| ~ ssList(tl(esk49_0))
| esk49_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43])]),c_0_22])]),c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssItem(hd(esk49_0))
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_21]),c_0_22])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_48,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_30]),c_0_22])]) ).
cnf(c_0_50,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC308+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n020.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 08:15:02 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.51 Running first-order theorem proving
% 0.16/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.50/0.65 % Version: 3.5.1
% 0.50/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.50/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.50/0.65 % Starting sh5l with 300s (1) cores
% 0.50/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2462953 completed with status 0
% 0.50/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.50/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.65 % No SInE strategy applied
% 0.50/0.65 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.50/0.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.50/0.65 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.50/0.65 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.50/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.50/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2462958 completed with status 0
% 0.50/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.50/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.65 % No SInE strategy applied
% 0.50/0.65 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.50/0.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.50/0.65 % Preprocessing time : 0.005 s
% 0.50/0.65 % Presaturation interreduction done
% 0.50/0.65
% 0.50/0.65 % Proof found!
% 0.50/0.65 % SZS status Theorem
% 0.50/0.65 % SZS output start CNFRefutation
% See solution above
% 0.50/0.65 % Parsed axioms : 96
% 0.50/0.65 % Removed by relevancy pruning/SinE : 0
% 0.50/0.65 % Initial clauses : 200
% 0.50/0.65 % Removed in clause preprocessing : 2
% 0.50/0.65 % Initial clauses in saturation : 198
% 0.50/0.65 % Processed clauses : 714
% 0.50/0.65 % ...of these trivial : 4
% 0.50/0.65 % ...subsumed : 182
% 0.50/0.65 % ...remaining for further processing : 528
% 0.50/0.65 % Other redundant clauses eliminated : 108
% 0.50/0.65 % Clauses deleted for lack of memory : 0
% 0.50/0.65 % Backward-subsumed : 13
% 0.50/0.65 % Backward-rewritten : 26
% 0.50/0.65 % Generated clauses : 1667
% 0.50/0.65 % ...of the previous two non-redundant : 1452
% 0.50/0.65 % ...aggressively subsumed : 0
% 0.50/0.65 % Contextual simplify-reflections : 65
% 0.50/0.65 % Paramodulations : 1559
% 0.50/0.65 % Factorizations : 0
% 0.50/0.65 % NegExts : 0
% 0.50/0.65 % Equation resolutions : 113
% 0.50/0.65 % Disequality decompositions : 0
% 0.50/0.65 % Total rewrite steps : 755
% 0.50/0.65 % ...of those cached : 728
% 0.50/0.65 % Propositional unsat checks : 0
% 0.50/0.65 % Propositional check models : 0
% 0.50/0.65 % Propositional check unsatisfiable : 0
% 0.50/0.65 % Propositional clauses : 0
% 0.50/0.65 % Propositional clauses after purity: 0
% 0.50/0.65 % Propositional unsat core size : 0
% 0.50/0.65 % Propositional preprocessing time : 0.000
% 0.50/0.65 % Propositional encoding time : 0.000
% 0.50/0.65 % Propositional solver time : 0.000
% 0.50/0.65 % Success case prop preproc time : 0.000
% 0.50/0.65 % Success case prop encoding time : 0.000
% 0.50/0.65 % Success case prop solver time : 0.000
% 0.50/0.65 % Current number of processed clauses : 273
% 0.50/0.65 % Positive orientable unit clauses : 23
% 0.50/0.65 % Positive unorientable unit clauses: 0
% 0.50/0.65 % Negative unit clauses : 2
% 0.50/0.65 % Non-unit-clauses : 248
% 0.50/0.65 % Current number of unprocessed clauses: 1080
% 0.50/0.65 % ...number of literals in the above : 6975
% 0.50/0.65 % Current number of archived formulas : 0
% 0.50/0.65 % Current number of archived clauses : 231
% 0.50/0.65 % Clause-clause subsumption calls (NU) : 24100
% 0.50/0.65 % Rec. Clause-clause subsumption calls : 6605
% 0.50/0.65 % Non-unit clause-clause subsumptions : 226
% 0.50/0.65 % Unit Clause-clause subsumption calls : 150
% 0.50/0.65 % Rewrite failures with RHS unbound : 0
% 0.50/0.65 % BW rewrite match attempts : 7
% 0.50/0.65 % BW rewrite match successes : 7
% 0.50/0.65 % Condensation attempts : 0
% 0.50/0.65 % Condensation successes : 0
% 0.50/0.65 % Termbank termtop insertions : 51801
% 0.50/0.65 % Search garbage collected termcells : 4397
% 0.50/0.65
% 0.50/0.65 % -------------------------------------------------
% 0.50/0.65 % User time : 0.086 s
% 0.50/0.65 % System time : 0.007 s
% 0.50/0.65 % Total time : 0.093 s
% 0.50/0.65 % Maximum resident set size: 4276 pages
% 0.50/0.65
% 0.50/0.65 % -------------------------------------------------
% 0.50/0.65 % User time : 0.255 s
% 0.50/0.65 % System time : 0.033 s
% 0.50/0.65 % Total time : 0.288 s
% 0.50/0.65 % Maximum resident set size: 4608 pages
% 0.50/0.65 % E exiting
%------------------------------------------------------------------------------