%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC184-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 : n004.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:22 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 21
% Syntax : Number of clauses : 84 ( 22 unt; 17 nHn; 84 RR)
% Number of literals : 202 ( 82 equ; 108 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_10,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_11,negated_conjecture,
( memberP(sk7,sk5)
| memberP(sk6,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(co1_17,negated_conjecture,
( nil = sk3
| cons(sk8,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_13,negated_conjecture,
( nil = sk3
| ssItem(sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause133,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_22,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_10 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(app(sk6,cons(sk5,nil)))
| sk3 != nil
| sk7 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_28 ).
cnf(c_0_32,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(app(sk6,cons(sk5,nil)))
| sk3 != nil
| app(sk6,cons(sk5,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil
| sk7 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_33 ).
cnf(c_0_37,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil
| app(sk6,cons(sk5,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
( memberP(sk7,sk5)
| memberP(sk6,sk5) ),
co1_11 ).
cnf(c_0_41,negated_conjecture,
( sk3 != nil
| sk7 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_32])]) ).
cnf(c_0_43,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_44,negated_conjecture,
( sk3 != nil
| memberP(sk6,sk5)
| memberP(nil,sk5) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( sk3 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_46,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_47,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_43 ).
cnf(c_0_48,negated_conjecture,
( sk3 != nil
| memberP(nil,sk5) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_46 ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_52,negated_conjecture,
( nil = sk3
| cons(sk8,nil) = sk3 ),
co1_17 ).
cnf(c_0_53,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_37])]) ).
cnf(c_0_54,negated_conjecture,
( nil = sk3
| ssItem(sk8) ),
co1_13 ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(sk6,app(cons(sk5,nil),sk7)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_49]),c_0_32]),c_0_27])]) ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_50 ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_51 ).
cnf(c_0_59,negated_conjecture,
cons(sk8,nil) = sk3,
inference(sr,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
ssItem(sk8),
inference(sr,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_55 ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(sk6,cons(sk5,sk7)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_37]),c_0_27])]) ).
cnf(c_0_63,negated_conjecture,
tl(sk3) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_38])]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk5,sk7))
| sk6 = nil
| app(tl(sk6),cons(sk5,sk7)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_32])]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(tl(sk6))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk5,sk7))
| sk6 = nil
| cons(sk5,sk7) = nil ),
inference(spm,[status(thm)],[c_0_25,c_0_64]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_65 ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(tl(sk6))
| ~ ssList(cons(sk5,nil))
| sk6 = nil
| cons(sk5,sk7) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_36]),c_0_37]),c_0_27])]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(tl(sk6))
| ~ ssList(cons(sk5,nil))
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_37]),c_0_27])]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_69 ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_32])]) ).
cnf(c_0_73,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_75,negated_conjecture,
app(app(nil,cons(sk5,nil)),sk7) = sk3,
inference(spm,[status(thm)],[c_0_26,c_0_73]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_74 ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(cons(sk5,nil),sk7) = sk3 ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| cons(sk5,sk7) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_77]),c_0_37]),c_0_27])]) ).
cnf(c_0_79,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk7 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_78]),c_0_63]),c_0_37]),c_0_27])]) ).
cnf(c_0_80,negated_conjecture,
( memberP(nil,sk5)
| memberP(sk7,sk5) ),
inference(rw,[status(thm)],[c_0_40,c_0_73]) ).
cnf(c_0_81,negated_conjecture,
sk7 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_82,negated_conjecture,
memberP(nil,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_82]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC184-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:02:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.20/0.50 % Version: 3.5.1
% 0.20/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 % Starting sh5l with 300s (1) cores
% 0.20/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2662174 completed with status 0
% 0.20/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.50 % No SInE strategy applied
% 0.20/0.50 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.50 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.50 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.50 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.20/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2662181 completed with status 0
% 0.20/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.50 % No SInE strategy applied
% 0.20/0.50 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.50 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.50 % Preprocessing time : 0.004 s
% 0.20/0.50 % Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 % Proof found!
% 0.20/0.50 % SZS status Unsatisfiable
% 0.20/0.50 % SZS output start CNFRefutation
% See solution above
% 0.20/0.51 % Parsed axioms : 204
% 0.20/0.51 % Removed by relevancy pruning/SinE : 0
% 0.20/0.51 % Initial clauses : 204
% 0.20/0.51 % Removed in clause preprocessing : 0
% 0.20/0.51 % Initial clauses in saturation : 204
% 0.20/0.51 % Processed clauses : 615
% 0.20/0.51 % ...of these trivial : 11
% 0.20/0.51 % ...subsumed : 65
% 0.20/0.51 % ...remaining for further processing : 539
% 0.20/0.51 % Other redundant clauses eliminated : 73
% 0.20/0.51 % Clauses deleted for lack of memory : 0
% 0.20/0.51 % Backward-subsumed : 36
% 0.20/0.51 % Backward-rewritten : 24
% 0.20/0.51 % Generated clauses : 1408
% 0.20/0.51 % ...of the previous two non-redundant : 1233
% 0.20/0.51 % ...aggressively subsumed : 0
% 0.20/0.51 % Contextual simplify-reflections : 17
% 0.20/0.51 % Paramodulations : 1321
% 0.20/0.51 % Factorizations : 0
% 0.20/0.51 % NegExts : 0
% 0.20/0.51 % Equation resolutions : 78
% 0.20/0.51 % Disequality decompositions : 0
% 0.20/0.51 % Total rewrite steps : 1534
% 0.20/0.51 % ...of those cached : 1410
% 0.20/0.51 % Propositional unsat checks : 0
% 0.20/0.51 % Propositional check models : 0
% 0.20/0.51 % Propositional check unsatisfiable : 0
% 0.20/0.51 % Propositional clauses : 0
% 0.20/0.51 % Propositional clauses after purity: 0
% 0.20/0.51 % Propositional unsat core size : 0
% 0.20/0.51 % Propositional preprocessing time : 0.000
% 0.20/0.51 % Propositional encoding time : 0.000
% 0.20/0.51 % Propositional solver time : 0.000
% 0.20/0.51 % Success case prop preproc time : 0.000
% 0.20/0.51 % Success case prop encoding time : 0.000
% 0.20/0.51 % Success case prop solver time : 0.000
% 0.20/0.51 % Current number of processed clauses : 250
% 0.20/0.51 % Positive orientable unit clauses : 81
% 0.20/0.51 % Positive unorientable unit clauses: 0
% 0.20/0.51 % Negative unit clauses : 3
% 0.20/0.51 % Non-unit-clauses : 166
% 0.20/0.51 % Current number of unprocessed clauses: 1000
% 0.20/0.51 % ...number of literals in the above : 5930
% 0.20/0.51 % Current number of archived formulas : 0
% 0.20/0.51 % Current number of archived clauses : 266
% 0.20/0.51 % Clause-clause subsumption calls (NU) : 14367
% 0.20/0.51 % Rec. Clause-clause subsumption calls : 2915
% 0.20/0.51 % Non-unit clause-clause subsumptions : 82
% 0.20/0.51 % Unit Clause-clause subsumption calls : 307
% 0.20/0.51 % Rewrite failures with RHS unbound : 0
% 0.20/0.51 % BW rewrite match attempts : 12
% 0.20/0.51 % BW rewrite match successes : 12
% 0.20/0.51 % Condensation attempts : 0
% 0.20/0.51 % Condensation successes : 0
% 0.20/0.51 % Termbank termtop insertions : 36327
% 0.20/0.51 % Search garbage collected termcells : 537
% 0.20/0.51
% 0.20/0.51 % -------------------------------------------------
% 0.20/0.51 % User time : 0.065 s
% 0.20/0.51 % System time : 0.006 s
% 0.20/0.51 % Total time : 0.071 s
% 0.20/0.51 % Maximum resident set size: 3816 pages
% 0.20/0.51
% 0.20/0.51 % -------------------------------------------------
% 0.20/0.51 % User time : 0.231 s
% 0.20/0.51 % System time : 0.046 s
% 0.20/0.51 % Total time : 0.278 s
% 0.20/0.51 % Maximum resident set size: 4864 pages
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------