%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN140-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 03:32:37 PM UTC 2026
% Result : Unsatisfiable 0.88s 0.55s
% Output : CNFRefutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 26
% Syntax : Number of clauses : 96 ( 37 unt; 0 nHn; 72 RR)
% Number of literals : 208 ( 0 equ; 118 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 157 ( 50 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_126,axiom,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(rule_125,axiom,
( ~ p0(X1,X1)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(rule_181,axiom,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_181) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(rule_273,axiom,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(rule_133,axiom,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).
cnf(rule_063,axiom,
( ~ k0(X2)
| ~ n0(d,X1)
| p1(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_063) ).
cnf(rule_279,axiom,
( ~ s3(a,X1)
| ~ l2(X3,X2)
| m4(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_279) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(rule_082,axiom,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_082) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(rule_050,axiom,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_050) ).
cnf(prove_this,negated_conjecture,
~ m4(b,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_189,axiom,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(rule_182,axiom,
( ~ q2(X2,X3,X1)
| ~ n1(X2,X1,X3)
| ~ p1(X1,X1,X3)
| q2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_182) ).
cnf(axiom_31,axiom,
m0(b,b,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_31) ).
cnf(rule_177,axiom,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_177) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_054,axiom,
( ~ n1(X1,X2,X1)
| ~ l1(X3,X1)
| ~ l0(X3)
| n1(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_054) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(c_0_26,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_27,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_28,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_29,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_30,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_26 ).
cnf(c_0_31,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_32,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_27 ).
cnf(c_0_33,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_34,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_28 ).
cnf(c_0_35,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_36,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_29 ).
cnf(c_0_37,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_39,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
s1(b),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_41,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
c_0_35 ).
cnf(c_0_42,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_43,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_38 ).
cnf(c_0_44,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( ~ k0(X2)
| ~ n0(d,X1)
| p1(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_063]) ).
cnf(c_0_46,plain,
( ~ s3(a,X1)
| ~ l2(X3,X2)
| m4(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_279]) ).
cnf(c_0_47,plain,
( ~ m0(X1,X3,X2)
| ~ s2(X1)
| s3(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_49,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_50,plain,
( ~ k0(X2)
| ~ n0(d,X1)
| p1(X1,X1,X2) ),
c_0_45 ).
cnf(c_0_51,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_52,plain,
( ~ s3(a,X1)
| ~ l2(X3,X2)
| m4(X1,X2) ),
c_0_46 ).
cnf(c_0_53,plain,
( ~ s2(X1)
| s3(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( ~ p0(X2,X2)
| l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_55,plain,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_082]) ).
cnf(c_0_56,plain,
( ~ k0(X1)
| p1(b,b,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,axiom,
k0(e),
axiom_28 ).
cnf(c_0_58,plain,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_050]) ).
cnf(c_0_59,negated_conjecture,
~ m4(b,X1),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_60,plain,
( ~ l2(X3,X2)
| ~ s2(a)
| m4(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_54,c_0_31]) ).
cnf(c_0_62,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_63,plain,
( ~ q2(X2,X3,X1)
| ~ n1(X2,X1,X3)
| ~ p1(X1,X1,X3)
| q2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_182]) ).
cnf(c_0_64,plain,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
c_0_55 ).
cnf(c_0_65,plain,
p1(b,b,e),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_66,axiom,
m0(b,b,e),
axiom_31 ).
cnf(c_0_67,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_177]) ).
cnf(c_0_68,plain,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
c_0_58 ).
cnf(c_0_69,axiom,
s0(b),
axiom_5 ).
cnf(c_0_70,negated_conjecture,
~ m4(b,X1),
c_0_59 ).
cnf(c_0_71,plain,
( ~ s2(a)
| m4(X1,X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_72,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
c_0_62 ).
cnf(c_0_73,plain,
( ~ q2(X2,X3,X1)
| ~ n1(X2,X1,X3)
| ~ p1(X1,X1,X3)
| q2(X1,X2,X1) ),
c_0_63 ).
cnf(c_0_74,plain,
p1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_75,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
c_0_67 ).
cnf(c_0_76,plain,
( ~ n1(X1,X2,X1)
| ~ l1(X3,X1)
| ~ l0(X3)
| n1(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_054]) ).
cnf(c_0_77,plain,
( ~ l0(X1)
| n1(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_31])]) ).
cnf(c_0_78,axiom,
l0(a),
axiom_20 ).
cnf(c_0_79,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_80,negated_conjecture,
~ s2(a),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_81,plain,
( ~ q2(b,X1,b)
| s2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_40])]) ).
cnf(c_0_82,plain,
( ~ n1(X1,b,b)
| ~ q2(X1,b,b)
| q2(b,X1,b) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_83,plain,
( ~ k0(X2)
| q2(X1,X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_37])]) ).
cnf(c_0_84,axiom,
k0(b),
axiom_32 ).
cnf(c_0_85,plain,
( ~ n1(X1,X2,X1)
| ~ l1(X3,X1)
| ~ l0(X3)
| n1(X1,X2,X2) ),
c_0_76 ).
cnf(c_0_86,plain,
n1(a,X1,a),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_87,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_79 ).
cnf(c_0_88,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_89,negated_conjecture,
~ q2(b,a,b),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_90,plain,
( ~ n1(X1,b,b)
| q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_91,plain,
( ~ l0(X2)
| ~ l1(X2,a)
| n1(a,X1,X1) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_92,plain,
l1(a,a),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_93,negated_conjecture,
~ n1(a,b,b),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_94,plain,
n1(a,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_78])]) ).
cnf(c_0_95,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN140-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n005.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 10:44:33 UTC 2026
% 0.04/0.38 % CPUTime :
% 0.04/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.42 Running first-order theorem proving
% 0.04/0.42 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.88/0.55 % Version: 3.5.1
% 0.88/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.88/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.88/0.55 % Starting sh5l with 300s (1) cores
% 0.88/0.55 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3263428 completed with status 0
% 0.88/0.55 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.88/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.88/0.55 % No SInE strategy applied
% 0.88/0.55 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.88/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.88/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.88/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.88/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.88/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.88/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.88/0.55 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3263436 completed with status 0
% 0.88/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.88/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.88/0.55 % No SInE strategy applied
% 0.88/0.55 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.88/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.88/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.88/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.88/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.88/0.55 % Preprocessing time : 0.003 s
% 0.88/0.55 % Presaturation interreduction done
% 0.88/0.55
% 0.88/0.55 % Proof found!
% 0.88/0.55 % SZS status Unsatisfiable
% 0.88/0.55 % SZS output start CNFRefutation
% See solution above
% 0.88/0.55 % Parsed axioms : 369
% 0.88/0.55 % Removed by relevancy pruning/SinE : 0
% 0.88/0.55 % Initial clauses : 369
% 0.88/0.55 % Removed in clause preprocessing : 7
% 0.88/0.55 % Initial clauses in saturation : 362
% 0.88/0.55 % Processed clauses : 1518
% 0.88/0.55 % ...of these trivial : 61
% 0.88/0.55 % ...subsumed : 92
% 0.88/0.55 % ...remaining for further processing : 1365
% 0.88/0.55 % Other redundant clauses eliminated : 0
% 0.88/0.55 % Clauses deleted for lack of memory : 0
% 0.88/0.55 % Backward-subsumed : 104
% 0.88/0.55 % Backward-rewritten : 378
% 0.88/0.55 % Generated clauses : 2226
% 0.88/0.55 % ...of the previous two non-redundant : 1604
% 0.88/0.55 % ...aggressively subsumed : 0
% 0.88/0.55 % Contextual simplify-reflections : 2
% 0.88/0.55 % Paramodulations : 2226
% 0.88/0.55 % Factorizations : 0
% 0.88/0.55 % NegExts : 0
% 0.88/0.55 % Equation resolutions : 0
% 0.88/0.55 % Disequality decompositions : 0
% 0.88/0.55 % Total rewrite steps : 1566
% 0.88/0.55 % ...of those cached : 1112
% 0.88/0.55 % Propositional unsat checks : 0
% 0.88/0.55 % Propositional check models : 0
% 0.88/0.55 % Propositional check unsatisfiable : 0
% 0.88/0.55 % Propositional clauses : 0
% 0.88/0.55 % Propositional clauses after purity: 0
% 0.88/0.55 % Propositional unsat core size : 0
% 0.88/0.55 % Propositional preprocessing time : 0.000
% 0.88/0.55 % Propositional encoding time : 0.000
% 0.88/0.55 % Propositional solver time : 0.000
% 0.88/0.55 % Success case prop preproc time : 0.000
% 0.88/0.55 % Success case prop encoding time : 0.000
% 0.88/0.55 % Success case prop solver time : 0.000
% 0.88/0.55 % Current number of processed clauses : 555
% 0.88/0.55 % Positive orientable unit clauses : 251
% 0.88/0.55 % Positive unorientable unit clauses: 0
% 0.88/0.55 % Negative unit clauses : 4
% 0.88/0.55 % Non-unit-clauses : 300
% 0.88/0.55 % Current number of unprocessed clauses: 321
% 0.88/0.55 % ...number of literals in the above : 1031
% 0.88/0.55 % Current number of archived formulas : 0
% 0.88/0.55 % Current number of archived clauses : 810
% 0.88/0.55 % Clause-clause subsumption calls (NU) : 64628
% 0.88/0.55 % Rec. Clause-clause subsumption calls : 48051
% 0.88/0.55 % Non-unit clause-clause subsumptions : 175
% 0.88/0.55 % Unit Clause-clause subsumption calls : 6128
% 0.88/0.55 % Rewrite failures with RHS unbound : 0
% 0.88/0.55 % BW rewrite match attempts : 902
% 0.88/0.55 % BW rewrite match successes : 259
% 0.88/0.55 % Condensation attempts : 0
% 0.88/0.55 % Condensation successes : 0
% 0.88/0.55 % Termbank termtop insertions : 38896
% 0.88/0.55 % Search garbage collected termcells : 1461
% 0.88/0.55
% 0.88/0.55 % -------------------------------------------------
% 0.88/0.55 % User time : 0.082 s
% 0.88/0.55 % System time : 0.011 s
% 0.88/0.55 % Total time : 0.093 s
% 0.88/0.55 % Maximum resident set size: 4472 pages
% 0.88/0.55
% 0.88/0.55 % -------------------------------------------------
% 0.88/0.55 % User time : 0.407 s
% 0.88/0.55 % System time : 0.040 s
% 0.88/0.55 % Total time : 0.447 s
% 0.88/0.55 % Maximum resident set size: 4864 pages
% 0.88/0.55 % E exiting
%------------------------------------------------------------------------------