%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN140-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:23:13 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.58s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 27
% Syntax : Number of clauses : 101 ( 37 unt; 0 nHn; 78 RR)
% Number of literals : 226 ( 0 equ; 130 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 169 ( 58 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(rule_125,axiom,
( ~ p0(X1,X1)
| s1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_181,axiom,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_181) ).
cnf(rule_133,axiom,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_133) ).
cnf(rule_273,axiom,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(rule_131,axiom,
( ~ l2(X2,X2)
| ~ n0(e,X2)
| ~ s1(X1)
| l2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_131) ).
cnf(axiom_31,axiom,
m0(b,b,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_31) ).
cnf(rule_071,axiom,
( ~ s0(b)
| ~ p1(X2,X4,X1)
| ~ l0(X3)
| p1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_071) ).
cnf(rule_069,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_069) ).
cnf(rule_279,axiom,
( ~ s3(a,X1)
| ~ l2(X3,X2)
| m4(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_279) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_050,axiom,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_050) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(prove_this,negated_conjecture,
~ m4(b,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_189,axiom,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_182) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_177,axiom,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_177) ).
cnf(rule_054,axiom,
( ~ n1(X1,X2,X1)
| ~ l1(X3,X1)
| ~ l0(X3)
| n1(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_054) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
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,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_30,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_27 ).
cnf(c_0_31,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_32,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_28 ).
cnf(c_0_33,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_34,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_35,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_29 ).
cnf(c_0_36,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_37,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
s1(b),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_40,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_34 ).
cnf(c_0_41,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_33]) ).
cnf(c_0_42,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_36 ).
cnf(c_0_43,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
c_0_39 ).
cnf(c_0_45,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_46,plain,
( ~ l2(X2,X2)
| ~ n0(e,X2)
| ~ s1(X1)
| l2(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_131]) ).
cnf(c_0_47,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_48,axiom,
m0(b,b,e),
axiom_31 ).
cnf(c_0_49,plain,
( ~ s0(b)
| ~ p1(X2,X4,X1)
| ~ l0(X3)
| p1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_071]) ).
cnf(c_0_50,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_069]) ).
cnf(c_0_51,plain,
( ~ s3(a,X1)
| ~ l2(X3,X2)
| m4(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_279]) ).
cnf(c_0_52,plain,
( ~ m0(X1,X3,X2)
| ~ s2(X1)
| s3(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_53,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_54,plain,
( ~ l2(X2,X2)
| ~ n0(e,X2)
| ~ s1(X1)
| l2(X1,X2) ),
c_0_46 ).
cnf(c_0_55,plain,
( ~ p0(X1,X1)
| l2(e,e) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
( ~ s0(b)
| ~ p1(X2,X4,X1)
| ~ l0(X3)
| p1(X1,X2,X1) ),
c_0_49 ).
cnf(c_0_57,axiom,
s0(b),
axiom_5 ).
cnf(c_0_58,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X2) ),
c_0_50 ).
cnf(c_0_59,plain,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_050]) ).
cnf(c_0_60,plain,
( ~ s3(a,X1)
| ~ l2(X3,X2)
| m4(X1,X2) ),
c_0_51 ).
cnf(c_0_61,plain,
( ~ s2(X1)
| s3(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
( ~ n0(e,X2)
| ~ l2(X2,X2)
| l2(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_43])]) ).
cnf(c_0_63,plain,
l2(e,e),
inference(spm,[status(thm)],[c_0_55,c_0_33]) ).
cnf(c_0_64,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_65,plain,
( ~ l0(X4)
| ~ p1(X2,X3,X1)
| p1(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).
cnf(c_0_66,plain,
p1(X1,X1,b),
inference(spm,[status(thm)],[c_0_58,c_0_33]) ).
cnf(c_0_67,plain,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
c_0_59 ).
cnf(c_0_68,negated_conjecture,
~ m4(b,X1),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_69,plain,
( ~ l2(X3,X2)
| ~ s2(a)
| m4(X1,X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_70,plain,
l2(X1,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_71,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_72,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_73,plain,
( ~ l0(X2)
| p1(b,X1,b) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,axiom,
l0(c),
axiom_24 ).
cnf(c_0_75,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_177]) ).
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_67,c_0_57]),c_0_33])]) ).
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,
~ m4(b,X1),
c_0_68 ).
cnf(c_0_81,plain,
( ~ s2(a)
| m4(X1,e) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_82,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
c_0_71 ).
cnf(c_0_83,plain,
( ~ q2(X2,X3,X1)
| ~ n1(X2,X1,X3)
| ~ p1(X1,X1,X3)
| q2(X1,X2,X1) ),
c_0_72 ).
cnf(c_0_84,plain,
p1(b,X1,b),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_85,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
c_0_75 ).
cnf(c_0_86,plain,
( ~ n1(X1,X2,X1)
| ~ l1(X3,X1)
| ~ l0(X3)
| n1(X1,X2,X2) ),
c_0_76 ).
cnf(c_0_87,plain,
n1(a,X1,a),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_88,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_79 ).
cnf(c_0_89,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_90,negated_conjecture,
~ s2(a),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_91,plain,
( ~ q2(b,X1,b)
| s2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_43])]) ).
cnf(c_0_92,plain,
( ~ n1(X1,b,b)
| ~ q2(X1,b,b)
| q2(b,X1,b) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_93,plain,
( ~ k0(X2)
| q2(X1,X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_41])]) ).
cnf(c_0_94,axiom,
k0(b),
axiom_32 ).
cnf(c_0_95,plain,
( ~ l0(X2)
| ~ l1(X2,a)
| n1(a,X1,X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_96,plain,
l1(a,a),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_97,negated_conjecture,
~ q2(b,a,b),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_98,plain,
( ~ n1(X1,b,b)
| q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94])]) ).
cnf(c_0_99,plain,
n1(a,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_78])]) ).
cnf(c_0_100,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99])]),
[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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.38 % Computer : n015.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 10:47:56 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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.16/5.58 % Version: 3.5.1
% 0.16/5.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.58 % Starting sh5l with 300s (1) cores
% 0.16/5.58 % sh5l with pid 1274299 completed with status 0
% 0.16/5.58 % Result found by sh5l
% 0.16/5.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.58 % Starting sh5l with 300s (1) cores
% 0.16/5.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.58 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.58 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.16/5.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.58 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.58 % SubtermCWHack with pid 1274307 completed with status 0
% 0.16/5.58 % Result found by SubtermCWHack
% 0.16/5.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.58 % Starting sh5l with 300s (1) cores
% 0.16/5.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.58 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.58 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.16/5.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.58 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.58 % Preprocessing time : 0.005 s
% 0.16/5.58
% 0.16/5.58 % Proof found!
% 0.16/5.58 % SZS status Unsatisfiable
% 0.16/5.58 % SZS output start CNFRefutation
% See solution above
% 0.16/5.58 % Parsed axioms : 369
% 0.16/5.58 % Removed by relevancy pruning/SinE : 0
% 0.16/5.58 % Initial clauses : 369
% 0.16/5.58 % Removed in clause preprocessing : 7
% 0.16/5.58 % Initial clauses in saturation : 362
% 0.16/5.58 % Processed clauses : 1813
% 0.16/5.58 % ...of these trivial : 163
% 0.16/5.58 % ...subsumed : 300
% 0.16/5.58 % ...remaining for further processing : 1350
% 0.16/5.58 % Other redundant clauses eliminated : 0
% 0.16/5.58 % Clauses deleted for lack of memory : 0
% 0.16/5.58 % Backward-subsumed : 287
% 0.16/5.58 % Backward-rewritten : 368
% 0.16/5.58 % Generated clauses : 2668
% 0.16/5.58 % ...of the previous two non-redundant : 2015
% 0.16/5.58 % ...aggressively subsumed : 0
% 0.16/5.58 % Contextual simplify-reflections : 0
% 0.16/5.58 % Paramodulations : 2668
% 0.16/5.58 % Factorizations : 0
% 0.16/5.58 % NegExts : 0
% 0.16/5.58 % Equation resolutions : 0
% 0.16/5.58 % Disequality decompositions : 0
% 0.16/5.58 % Total rewrite steps : 1895
% 0.16/5.58 % ...of those cached : 1330
% 0.16/5.58 % Propositional unsat checks : 0
% 0.16/5.58 % Propositional check models : 0
% 0.16/5.58 % Propositional check unsatisfiable : 0
% 0.16/5.58 % Propositional clauses : 0
% 0.16/5.58 % Propositional clauses after purity: 0
% 0.16/5.58 % Propositional unsat core size : 0
% 0.16/5.58 % Propositional preprocessing time : 0.000
% 0.16/5.58 % Propositional encoding time : 0.000
% 0.16/5.58 % Propositional solver time : 0.000
% 0.16/5.58 % Success case prop preproc time : 0.000
% 0.16/5.58 % Success case prop encoding time : 0.000
% 0.16/5.58 % Success case prop solver time : 0.000
% 0.16/5.58 % Current number of processed clauses : 695
% 0.16/5.58 % Positive orientable unit clauses : 262
% 0.16/5.58 % Positive unorientable unit clauses: 0
% 0.16/5.58 % Negative unit clauses : 4
% 0.16/5.58 % Non-unit-clauses : 429
% 0.16/5.58 % Current number of unprocessed clauses: 124
% 0.16/5.58 % ...number of literals in the above : 521
% 0.16/5.58 % Current number of archived formulas : 0
% 0.16/5.58 % Current number of archived clauses : 655
% 0.16/5.58 % Clause-clause subsumption calls (NU) : 56563
% 0.16/5.58 % Rec. Clause-clause subsumption calls : 47724
% 0.16/5.58 % Non-unit clause-clause subsumptions : 487
% 0.16/5.58 % Unit Clause-clause subsumption calls : 5493
% 0.16/5.58 % Rewrite failures with RHS unbound : 0
% 0.16/5.58 % BW rewrite match attempts : 792
% 0.16/5.58 % BW rewrite match successes : 325
% 0.16/5.58 % Condensation attempts : 0
% 0.16/5.58 % Condensation successes : 0
% 0.16/5.58 % Termbank termtop insertions : 42125
% 0.16/5.58 % Search garbage collected termcells : 1461
% 0.16/5.58
% 0.16/5.58 % -------------------------------------------------
% 0.16/5.58 % User time : 0.119 s
% 0.16/5.58 % System time : 0.010 s
% 0.16/5.58 % Total time : 0.129 s
% 0.16/5.58 % Maximum resident set size: 4472 pages
% 0.16/5.58
% 0.16/5.58 % -------------------------------------------------
% 0.16/5.58 % User time : 0.125 s
% 0.16/5.58 % System time : 0.016 s
% 0.16/5.58 % Total time : 0.141 s
% 0.16/5.58 % Maximum resident set size: 5120 pages
% 0.16/5.58 % E exiting
%------------------------------------------------------------------------------