%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS010-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:01:18 PM UTC 2026
% Result : Unsatisfiable 0.17s 5.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of clauses : 74 ( 9 unt; 28 nHn; 74 RR)
% Number of literals : 202 ( 0 equ; 112 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_8,axiom,
( ~ r(X2,X1)
| ~ e(X2)
| a(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_22,axiom,
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_7,axiom,
( ~ e(X1)
| r3least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_3,axiom,
( ~ a(X1)
| d(X1)
| c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_31,axiom,
( ~ d(X3)
| ~ d(X2)
| ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X2,X3)
| f(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).
cnf(clause_23,axiom,
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_24,axiom,
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
cnf(clause_6,axiom,
( ~ c(X2)
| ~ c(X1)
| ~ r(X3,X2)
| ~ r(X3,X1)
| ~ e(X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_19,axiom,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_21,axiom,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_20,axiom,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
cnf(c_0_13,plain,
( ~ r(X2,X1)
| ~ e(X2)
| a(X1) ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_14,plain,
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_22]) ).
cnf(c_0_15,plain,
( ~ e(X1)
| r3least(X1) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_16,plain,
( ~ a(X1)
| d(X1)
| c(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_17,plain,
( ~ r(X2,X1)
| ~ e(X2)
| a(X1) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ e(X1)
| r3least(X1) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ d(X3)
| ~ d(X2)
| ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X2,X3)
| f(X1) ),
inference(fof_simplification,[status(thm)],[clause_31]) ).
cnf(c_0_21,plain,
( ~ a(X1)
| d(X1)
| c(X1) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ e(X1)
| a(u2r1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
inference(fof_simplification,[status(thm)],[clause_23]) ).
cnf(c_0_24,plain,
( ~ d(X3)
| ~ d(X2)
| ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X2,X3)
| f(X1) ),
c_0_20 ).
cnf(c_0_25,plain,
( ~ e(X1)
| c(u2r1(X1))
| d(u2r1(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_27,negated_conjecture,
~ f(exist),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_28,plain,
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
c_0_23 ).
cnf(c_0_29,plain,
( ~ d(X1)
| ~ d(u2r1(X2))
| ~ r(X2,X1)
| ~ r3least(X2)
| f(X2)
| equalish(X1,u2r1(X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_30,negated_conjecture,
( c(u2r1(exist))
| d(u2r1(exist)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
r3least(exist),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ f(exist),
c_0_27 ).
cnf(c_0_33,plain,
( ~ e(X1)
| a(u2r2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_19]) ).
cnf(c_0_34,plain,
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
inference(fof_simplification,[status(thm)],[clause_24]) ).
cnf(c_0_35,negated_conjecture,
( ~ d(X1)
| ~ r(exist,X1)
| c(u2r1(exist))
| equalish(X1,u2r1(exist)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_36,plain,
( ~ e(X1)
| c(u2r2(X1))
| d(u2r2(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_37,plain,
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
c_0_34 ).
cnf(c_0_38,plain,
( ~ c(X2)
| ~ c(X1)
| ~ r(X3,X2)
| ~ r(X3,X1)
| ~ e(X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_39,plain,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[clause_19]) ).
cnf(c_0_40,negated_conjecture,
( ~ d(u2r2(exist))
| c(u2r1(exist))
| equalish(u2r2(exist),u2r1(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_31])]) ).
cnf(c_0_41,negated_conjecture,
( c(u2r2(exist))
| d(u2r2(exist)) ),
inference(spm,[status(thm)],[c_0_36,c_0_26]) ).
cnf(c_0_42,plain,
( ~ d(X1)
| ~ d(u2r2(X2))
| ~ r(X2,X1)
| ~ r3least(X2)
| f(X2)
| equalish(X1,u2r2(X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_43,plain,
( ~ e(X1)
| a(u2r3(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_37]),c_0_19]) ).
cnf(c_0_44,plain,
( ~ c(X2)
| ~ c(X1)
| ~ r(X3,X2)
| ~ r(X3,X1)
| ~ e(X3)
| equalish(X1,X2) ),
c_0_38 ).
cnf(c_0_45,plain,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
c_0_39 ).
cnf(c_0_46,negated_conjecture,
( c(u2r1(exist))
| c(u2r2(exist))
| equalish(u2r2(exist),u2r1(exist)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( ~ d(X1)
| ~ r(exist,X1)
| c(u2r2(exist))
| equalish(X1,u2r2(exist)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),c_0_31])]),c_0_32]) ).
cnf(c_0_48,plain,
( ~ e(X1)
| c(u2r3(X1))
| d(u2r3(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_43]) ).
cnf(c_0_49,plain,
( ~ e(X2)
| ~ c(X1)
| ~ c(u2r1(X2))
| ~ r(X2,X1)
| equalish(X1,u2r1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_18]),c_0_19]) ).
cnf(c_0_50,negated_conjecture,
( c(u2r2(exist))
| c(u2r1(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_31])]) ).
cnf(c_0_51,plain,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[clause_21]) ).
cnf(c_0_52,negated_conjecture,
( ~ d(u2r3(exist))
| c(u2r2(exist))
| equalish(u2r3(exist),u2r2(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_37]),c_0_31])]) ).
cnf(c_0_53,negated_conjecture,
( c(u2r3(exist))
| d(u2r3(exist)) ),
inference(spm,[status(thm)],[c_0_48,c_0_26]) ).
cnf(c_0_54,negated_conjecture,
( ~ c(X1)
| ~ r(exist,X1)
| c(u2r2(exist))
| equalish(X1,u2r1(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_26])]) ).
cnf(c_0_55,plain,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
c_0_51 ).
cnf(c_0_56,negated_conjecture,
( c(u2r2(exist))
| c(u2r3(exist))
| equalish(u2r3(exist),u2r2(exist)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[clause_20]) ).
cnf(c_0_58,negated_conjecture,
( ~ c(u2r3(exist))
| c(u2r2(exist))
| equalish(u2r3(exist),u2r1(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_37]),c_0_31])]) ).
cnf(c_0_59,negated_conjecture,
( c(u2r3(exist))
| c(u2r2(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_31])]) ).
cnf(c_0_60,plain,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
c_0_57 ).
cnf(c_0_61,negated_conjecture,
( c(u2r2(exist))
| equalish(u2r3(exist),u2r1(exist)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
( ~ e(X2)
| ~ c(X1)
| ~ c(u2r2(X2))
| ~ r(X2,X1)
| equalish(X1,u2r2(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_28]),c_0_19]) ).
cnf(c_0_63,negated_conjecture,
c(u2r2(exist)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_31])]) ).
cnf(c_0_64,negated_conjecture,
( ~ d(u2r3(exist))
| c(u2r1(exist))
| equalish(u2r3(exist),u2r1(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_37]),c_0_31])]) ).
cnf(c_0_65,negated_conjecture,
( ~ c(X1)
| ~ r(exist,X1)
| equalish(X1,u2r2(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_26])]) ).
cnf(c_0_66,negated_conjecture,
( c(u2r1(exist))
| c(u2r3(exist))
| equalish(u2r3(exist),u2r1(exist)) ),
inference(spm,[status(thm)],[c_0_64,c_0_53]) ).
cnf(c_0_67,negated_conjecture,
( ~ c(u2r3(exist))
| ~ r(exist,u2r3(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_65]),c_0_31])]) ).
cnf(c_0_68,negated_conjecture,
( c(u2r3(exist))
| c(u2r1(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_66]),c_0_31])]) ).
cnf(c_0_69,negated_conjecture,
( ~ r(exist,u2r3(exist))
| c(u2r1(exist)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
( ~ c(X1)
| ~ r(exist,X1)
| ~ r(exist,u2r3(exist))
| equalish(X1,u2r1(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_69]),c_0_26])]) ).
cnf(c_0_71,negated_conjecture,
( ~ r(exist,u2r2(exist))
| ~ r(exist,u2r3(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_70]),c_0_31]),c_0_63])]) ).
cnf(c_0_72,negated_conjecture,
~ r(exist,u2r2(exist)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_37]),c_0_31])]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_28]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS010-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.39 % Computer : n026.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Sun Sep 20 22:52:57 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.44 Running first-order theorem proving
% 0.17/5.44 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.17/5.47 % Version: 3.5.1
% 0.17/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.47 % Starting sh5l with 300s (1) cores
% 0.17/5.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 766681 completed with status 0
% 0.17/5.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.47 % No SInE strategy applied
% 0.17/5.47 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.17/5.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.47 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/5.47 % Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.17/5.47 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/5.47 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.17/5.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 766686 completed with status 0
% 0.17/5.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.47 % No SInE strategy applied
% 0.17/5.47 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.17/5.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.47 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/5.47 % Preprocessing time : 0.001 s
% 0.17/5.47 % Presaturation interreduction done
% 0.17/5.47
% 0.17/5.47 % Proof found!
% 0.17/5.47 % SZS status Unsatisfiable
% 0.17/5.47 % SZS output start CNFRefutation
% See solution above
% 0.17/5.47 % Parsed axioms : 31
% 0.17/5.47 % Removed by relevancy pruning/SinE : 0
% 0.17/5.47 % Initial clauses : 31
% 0.17/5.47 % Removed in clause preprocessing : 0
% 0.17/5.47 % Initial clauses in saturation : 31
% 0.17/5.47 % Processed clauses : 145
% 0.17/5.47 % ...of these trivial : 0
% 0.17/5.47 % ...subsumed : 19
% 0.17/5.47 % ...remaining for further processing : 126
% 0.17/5.47 % Other redundant clauses eliminated : 0
% 0.17/5.47 % Clauses deleted for lack of memory : 0
% 0.17/5.47 % Backward-subsumed : 9
% 0.17/5.47 % Backward-rewritten : 10
% 0.17/5.47 % Generated clauses : 122
% 0.17/5.47 % ...of the previous two non-redundant : 90
% 0.17/5.47 % ...aggressively subsumed : 0
% 0.17/5.47 % Contextual simplify-reflections : 15
% 0.17/5.47 % Paramodulations : 122
% 0.17/5.47 % Factorizations : 0
% 0.17/5.47 % NegExts : 0
% 0.17/5.47 % Equation resolutions : 0
% 0.17/5.47 % Disequality decompositions : 0
% 0.17/5.47 % Total rewrite steps : 52
% 0.17/5.47 % ...of those cached : 46
% 0.17/5.47 % Propositional unsat checks : 0
% 0.17/5.47 % Propositional check models : 0
% 0.17/5.47 % Propositional check unsatisfiable : 0
% 0.17/5.47 % Propositional clauses : 0
% 0.17/5.47 % Propositional clauses after purity: 0
% 0.17/5.47 % Propositional unsat core size : 0
% 0.17/5.47 % Propositional preprocessing time : 0.000
% 0.17/5.47 % Propositional encoding time : 0.000
% 0.17/5.47 % Propositional solver time : 0.000
% 0.17/5.47 % Success case prop preproc time : 0.000
% 0.17/5.47 % Success case prop encoding time : 0.000
% 0.17/5.47 % Success case prop solver time : 0.000
% 0.17/5.47 % Current number of processed clauses : 76
% 0.17/5.47 % Positive orientable unit clauses : 6
% 0.17/5.47 % Positive unorientable unit clauses: 0
% 0.17/5.47 % Negative unit clauses : 2
% 0.17/5.47 % Non-unit-clauses : 68
% 0.17/5.47 % Current number of unprocessed clauses: 2
% 0.17/5.47 % ...number of literals in the above : 11
% 0.17/5.47 % Current number of archived formulas : 0
% 0.17/5.47 % Current number of archived clauses : 50
% 0.17/5.47 % Clause-clause subsumption calls (NU) : 2701
% 0.17/5.47 % Rec. Clause-clause subsumption calls : 1241
% 0.17/5.47 % Non-unit clause-clause subsumptions : 32
% 0.17/5.47 % Unit Clause-clause subsumption calls : 127
% 0.17/5.47 % Rewrite failures with RHS unbound : 0
% 0.17/5.47 % BW rewrite match attempts : 1
% 0.17/5.47 % BW rewrite match successes : 1
% 0.17/5.47 % Condensation attempts : 0
% 0.17/5.47 % Condensation successes : 0
% 0.17/5.47 % Termbank termtop insertions : 3842
% 0.17/5.47 % Search garbage collected termcells : 88
% 0.17/5.47
% 0.17/5.47 % -------------------------------------------------
% 0.17/5.47 % User time : 0.013 s
% 0.17/5.47 % System time : 0.002 s
% 0.17/5.47 % Total time : 0.014 s
% 0.17/5.47 % Maximum resident set size: 3652 pages
% 0.17/5.47
% 0.17/5.47 % -------------------------------------------------
% 0.17/5.47 % User time : 0.029 s
% 0.17/5.47 % System time : 0.012 s
% 0.17/5.47 % Total time : 0.041 s
% 0.17/5.47 % Maximum resident set size: 4864 pages
% 0.17/5.47 % E exiting
%------------------------------------------------------------------------------