%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP001-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 : n007.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:33:51 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 30
% Syntax : Number of clauses : 89 ( 28 unt; 20 nHn; 89 RR)
% Number of literals : 266 ( 0 equ; 163 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause29,negated_conjecture,
( ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X1)
| ~ barrel(X3,X2)
| ~ event(X3)
| ~ chevy(X2)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ old(X2)
| ~ lonely(X1)
| ~ way(X1)
| ~ street(X1)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause29) ).
cnf(clause25,negated_conjecture,
( in(skc14,skc15)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause25) ).
cnf(clause2,negated_conjecture,
event(skc14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause1,negated_conjecture,
hollywood(skc15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause15,negated_conjecture,
( city(skc15)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause15) ).
cnf(clause24,negated_conjecture,
( down(skc14,skc13)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause24) ).
cnf(clause3,negated_conjecture,
street(skc13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause13,negated_conjecture,
( lonely(skc13)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).
cnf(clause14,negated_conjecture,
( way(skc13)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause14) ).
cnf(clause30,negated_conjecture,
( ~ ssSkC0
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X2)
| ~ barrel(X3,X1)
| ~ event(X3)
| ~ street(X2)
| ~ way(X2)
| ~ lonely(X2)
| ~ old(X1)
| ~ dirty(X1)
| ~ white(X1)
| ~ car(X1)
| ~ chevy(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause30) ).
cnf(clause23,negated_conjecture,
( barrel(skc14,skc12)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause23) ).
cnf(clause4,negated_conjecture,
old(skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause9,negated_conjecture,
( chevy(skc12)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause9) ).
cnf(clause10,negated_conjecture,
( car(skc12)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).
cnf(clause11,negated_conjecture,
( white(skc12)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).
cnf(clause12,negated_conjecture,
( dirty(skc12)
| ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).
cnf(clause28,negated_conjecture,
( ~ ssSkC0
| in(skc10,skc11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause28) ).
cnf(clause22,negated_conjecture,
( ~ ssSkC0
| city(skc11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause22) ).
cnf(clause27,negated_conjecture,
( ~ ssSkC0
| down(skc10,skc8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause27) ).
cnf(clause17,negated_conjecture,
( ~ ssSkC0
| way(skc8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause17) ).
cnf(clause16,negated_conjecture,
( ~ ssSkC0
| street(skc8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause16) ).
cnf(clause6,negated_conjecture,
event(skc10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(clause5,negated_conjecture,
hollywood(skc11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause26,negated_conjecture,
( ~ ssSkC0
| barrel(skc10,skc9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause26) ).
cnf(clause19,negated_conjecture,
( ~ ssSkC0
| dirty(skc9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause19) ).
cnf(clause20,negated_conjecture,
( ~ ssSkC0
| white(skc9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause20) ).
cnf(clause21,negated_conjecture,
( ~ ssSkC0
| car(skc9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause21) ).
cnf(clause18,negated_conjecture,
( ~ ssSkC0
| old(skc9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause18) ).
cnf(clause8,negated_conjecture,
lonely(skc8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
cnf(clause7,negated_conjecture,
chevy(skc9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
cnf(c_0_30,negated_conjecture,
( ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X1)
| ~ barrel(X3,X2)
| ~ event(X3)
| ~ chevy(X2)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ old(X2)
| ~ lonely(X1)
| ~ way(X1)
| ~ street(X1)
| ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause29]) ).
cnf(c_0_31,negated_conjecture,
( ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X1)
| ~ barrel(X3,X2)
| ~ event(X3)
| ~ chevy(X2)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ old(X2)
| ~ lonely(X1)
| ~ way(X1)
| ~ street(X1)
| ssSkC0 ),
c_0_30 ).
cnf(c_0_32,negated_conjecture,
( in(skc14,skc15)
| ssSkC0 ),
clause25 ).
cnf(c_0_33,negated_conjecture,
event(skc14),
clause2 ).
cnf(c_0_34,negated_conjecture,
hollywood(skc15),
clause1 ).
cnf(c_0_35,negated_conjecture,
( city(skc15)
| ssSkC0 ),
clause15 ).
cnf(c_0_36,negated_conjecture,
( ~ street(X1)
| ~ old(X2)
| ~ chevy(X2)
| ~ lonely(X1)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ way(X1)
| ~ barrel(skc14,X2)
| ~ down(skc14,X1)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( down(skc14,skc13)
| ssSkC0 ),
clause24 ).
cnf(c_0_38,negated_conjecture,
street(skc13),
clause3 ).
cnf(c_0_39,negated_conjecture,
( lonely(skc13)
| ssSkC0 ),
clause13 ).
cnf(c_0_40,negated_conjecture,
( way(skc13)
| ssSkC0 ),
clause14 ).
cnf(c_0_41,negated_conjecture,
( ~ ssSkC0
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X2)
| ~ barrel(X3,X1)
| ~ event(X3)
| ~ street(X2)
| ~ way(X2)
| ~ lonely(X2)
| ~ old(X1)
| ~ dirty(X1)
| ~ white(X1)
| ~ car(X1)
| ~ chevy(X1) ),
inference(fof_simplification,[status(thm)],[clause30]) ).
cnf(c_0_42,negated_conjecture,
( ~ old(X1)
| ~ chevy(X1)
| ~ car(X1)
| ~ white(X1)
| ~ dirty(X1)
| ~ barrel(skc14,X1)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( barrel(skc14,skc12)
| ssSkC0 ),
clause23 ).
cnf(c_0_44,negated_conjecture,
old(skc12),
clause4 ).
cnf(c_0_45,negated_conjecture,
( chevy(skc12)
| ssSkC0 ),
clause9 ).
cnf(c_0_46,negated_conjecture,
( car(skc12)
| ssSkC0 ),
clause10 ).
cnf(c_0_47,negated_conjecture,
( white(skc12)
| ssSkC0 ),
clause11 ).
cnf(c_0_48,negated_conjecture,
( dirty(skc12)
| ssSkC0 ),
clause12 ).
cnf(c_0_49,negated_conjecture,
( ~ ssSkC0
| in(skc10,skc11) ),
inference(fof_simplification,[status(thm)],[clause28]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssSkC0
| city(skc11) ),
inference(fof_simplification,[status(thm)],[clause22]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssSkC0
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X2)
| ~ barrel(X3,X1)
| ~ event(X3)
| ~ street(X2)
| ~ way(X2)
| ~ lonely(X2)
| ~ old(X1)
| ~ dirty(X1)
| ~ white(X1)
| ~ car(X1)
| ~ chevy(X1) ),
c_0_41 ).
cnf(c_0_52,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]),c_0_46]),c_0_47]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssSkC0
| in(skc10,skc11) ),
c_0_49 ).
cnf(c_0_54,negated_conjecture,
( ~ ssSkC0
| city(skc11) ),
c_0_50 ).
cnf(c_0_55,negated_conjecture,
( ~ ssSkC0
| down(skc10,skc8) ),
inference(fof_simplification,[status(thm)],[clause27]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssSkC0
| way(skc8) ),
inference(fof_simplification,[status(thm)],[clause17]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssSkC0
| street(skc8) ),
inference(fof_simplification,[status(thm)],[clause16]) ).
cnf(c_0_58,negated_conjecture,
( ~ hollywood(X2)
| ~ event(X1)
| ~ street(X3)
| ~ old(X4)
| ~ chevy(X4)
| ~ lonely(X3)
| ~ car(X4)
| ~ white(X4)
| ~ dirty(X4)
| ~ way(X3)
| ~ city(X2)
| ~ barrel(X1,X4)
| ~ down(X1,X3)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_59,negated_conjecture,
in(skc10,skc11),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_52])]) ).
cnf(c_0_60,negated_conjecture,
city(skc11),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_52])]) ).
cnf(c_0_61,negated_conjecture,
event(skc10),
clause6 ).
cnf(c_0_62,negated_conjecture,
hollywood(skc11),
clause5 ).
cnf(c_0_63,negated_conjecture,
( ~ ssSkC0
| down(skc10,skc8) ),
c_0_55 ).
cnf(c_0_64,negated_conjecture,
( ~ ssSkC0
| way(skc8) ),
c_0_56 ).
cnf(c_0_65,negated_conjecture,
( ~ ssSkC0
| street(skc8) ),
c_0_57 ).
cnf(c_0_66,negated_conjecture,
( ~ ssSkC0
| barrel(skc10,skc9) ),
inference(fof_simplification,[status(thm)],[clause26]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssSkC0
| dirty(skc9) ),
inference(fof_simplification,[status(thm)],[clause19]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssSkC0
| white(skc9) ),
inference(fof_simplification,[status(thm)],[clause20]) ).
cnf(c_0_69,negated_conjecture,
( ~ ssSkC0
| car(skc9) ),
inference(fof_simplification,[status(thm)],[clause21]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssSkC0
| old(skc9) ),
inference(fof_simplification,[status(thm)],[clause18]) ).
cnf(c_0_71,negated_conjecture,
( ~ street(X1)
| ~ old(X2)
| ~ chevy(X2)
| ~ lonely(X1)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ way(X1)
| ~ barrel(skc10,X2)
| ~ down(skc10,X1) ),
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_59]),c_0_60]),c_0_61]),c_0_62])]) ).
cnf(c_0_72,negated_conjecture,
down(skc10,skc8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_52])]) ).
cnf(c_0_73,negated_conjecture,
way(skc8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_52])]) ).
cnf(c_0_74,negated_conjecture,
lonely(skc8),
clause8 ).
cnf(c_0_75,negated_conjecture,
street(skc8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_52])]) ).
cnf(c_0_76,negated_conjecture,
( ~ ssSkC0
| barrel(skc10,skc9) ),
c_0_66 ).
cnf(c_0_77,negated_conjecture,
( ~ ssSkC0
| dirty(skc9) ),
c_0_67 ).
cnf(c_0_78,negated_conjecture,
( ~ ssSkC0
| white(skc9) ),
c_0_68 ).
cnf(c_0_79,negated_conjecture,
( ~ ssSkC0
| car(skc9) ),
c_0_69 ).
cnf(c_0_80,negated_conjecture,
( ~ ssSkC0
| old(skc9) ),
c_0_70 ).
cnf(c_0_81,negated_conjecture,
( ~ old(X1)
| ~ chevy(X1)
| ~ car(X1)
| ~ white(X1)
| ~ dirty(X1)
| ~ barrel(skc10,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_74]),c_0_75])]) ).
cnf(c_0_82,negated_conjecture,
barrel(skc10,skc9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_52])]) ).
cnf(c_0_83,negated_conjecture,
dirty(skc9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_52])]) ).
cnf(c_0_84,negated_conjecture,
white(skc9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_52])]) ).
cnf(c_0_85,negated_conjecture,
car(skc9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_52])]) ).
cnf(c_0_86,negated_conjecture,
chevy(skc9),
clause7 ).
cnf(c_0_87,negated_conjecture,
old(skc9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_52])]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84]),c_0_85]),c_0_86]),c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP001-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.11/5.39 % Computer : n007.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Mon Sep 21 01:28:25 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.44 Running first-order theorem proving
% 0.15/5.44 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.15/5.46 % Version: 3.5.1
% 0.15/5.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % new_bool_3 with pid 4071747 completed with status 0
% 0.15/5.46 % Result found by new_bool_3
% 0.15/5.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.15/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.46 % SubtermCWHack with pid 4071750 completed with status 0
% 0.15/5.46 % Result found by SubtermCWHack
% 0.15/5.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.15/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.46 % Preprocessing time : 0.001 s
% 0.15/5.46
% 0.15/5.46 % Proof found!
% 0.15/5.46 % SZS status Unsatisfiable
% 0.15/5.46 % SZS output start CNFRefutation
% See solution above
% 0.15/5.46 % Parsed axioms : 30
% 0.15/5.46 % Removed by relevancy pruning/SinE : 0
% 0.15/5.46 % Initial clauses : 30
% 0.15/5.46 % Removed in clause preprocessing : 0
% 0.15/5.46 % Initial clauses in saturation : 30
% 0.15/5.46 % Processed clauses : 45
% 0.15/5.46 % ...of these trivial : 0
% 0.15/5.46 % ...subsumed : 0
% 0.15/5.46 % ...remaining for further processing : 45
% 0.15/5.46 % Other redundant clauses eliminated : 0
% 0.15/5.46 % Clauses deleted for lack of memory : 0
% 0.15/5.46 % Backward-subsumed : 2
% 0.15/5.46 % Backward-rewritten : 22
% 0.15/5.46 % Generated clauses : 7
% 0.15/5.46 % ...of the previous two non-redundant : 15
% 0.15/5.46 % ...aggressively subsumed : 0
% 0.15/5.46 % Contextual simplify-reflections : 7
% 0.15/5.46 % Paramodulations : 7
% 0.15/5.46 % Factorizations : 0
% 0.15/5.46 % NegExts : 0
% 0.15/5.46 % Equation resolutions : 0
% 0.15/5.46 % Disequality decompositions : 0
% 0.15/5.46 % Total rewrite steps : 40
% 0.15/5.46 % ...of those cached : 24
% 0.15/5.46 % Propositional unsat checks : 0
% 0.15/5.46 % Propositional check models : 0
% 0.15/5.46 % Propositional check unsatisfiable : 0
% 0.15/5.46 % Propositional clauses : 0
% 0.15/5.46 % Propositional clauses after purity: 0
% 0.15/5.46 % Propositional unsat core size : 0
% 0.15/5.46 % Propositional preprocessing time : 0.000
% 0.15/5.46 % Propositional encoding time : 0.000
% 0.15/5.46 % Propositional solver time : 0.000
% 0.15/5.46 % Success case prop preproc time : 0.000
% 0.15/5.46 % Success case prop encoding time : 0.000
% 0.15/5.46 % Success case prop solver time : 0.000
% 0.15/5.46 % Current number of processed clauses : 21
% 0.15/5.46 % Positive orientable unit clauses : 19
% 0.15/5.46 % Positive unorientable unit clauses: 0
% 0.15/5.46 % Negative unit clauses : 0
% 0.15/5.46 % Non-unit-clauses : 2
% 0.15/5.46 % Current number of unprocessed clauses: 0
% 0.15/5.46 % ...number of literals in the above : 0
% 0.15/5.46 % Current number of archived formulas : 0
% 0.15/5.46 % Current number of archived clauses : 24
% 0.15/5.46 % Clause-clause subsumption calls (NU) : 54
% 0.15/5.46 % Rec. Clause-clause subsumption calls : 44
% 0.15/5.46 % Non-unit clause-clause subsumptions : 9
% 0.15/5.46 % Unit Clause-clause subsumption calls : 0
% 0.15/5.46 % Rewrite failures with RHS unbound : 0
% 0.15/5.46 % BW rewrite match attempts : 1
% 0.15/5.46 % BW rewrite match successes : 1
% 0.15/5.46 % Condensation attempts : 0
% 0.15/5.46 % Condensation successes : 0
% 0.15/5.46 % Termbank termtop insertions : 1178
% 0.15/5.46 % Search garbage collected termcells : 87
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.005 s
% 0.15/5.46 % System time : 0.002 s
% 0.15/5.46 % Total time : 0.006 s
% 0.15/5.46 % Maximum resident set size: 3656 pages
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.008 s
% 0.15/5.46 % System time : 0.005 s
% 0.15/5.46 % Total time : 0.013 s
% 0.15/5.46 % Maximum resident set size: 4608 pages
% 0.15/5.46 % E exiting
%------------------------------------------------------------------------------