%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN128-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 : n011.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:11 PM UTC 2026
% Result : Unsatisfiable 0.53s 0.49s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 28
% Syntax : Number of clauses : 112 ( 38 unt; 0 nHn; 79 RR)
% Number of literals : 244 ( 0 equ; 135 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 22 ( 21 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 209 ( 81 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_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_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(rule_228,axiom,
( ~ m3(X3,X1,X3)
| ~ m2(X2)
| ~ n2(X1)
| m3(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_228) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
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_244,axiom,
( ~ n2(X1)
| p3(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_244) ).
cnf(rule_136,axiom,
( ~ k1(b)
| m2(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_136) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
cnf(rule_201,axiom,
( ~ m2(X3)
| ~ m2(X4)
| ~ p1(X2,X3,X1)
| k3(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_201) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(rule_277,axiom,
( ~ p3(X2,X3,X1)
| l4(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_277) ).
cnf(rule_124,axiom,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(rule_110,axiom,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_110) ).
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_296,axiom,
( ~ q4(X2,X3)
| ~ l4(X2)
| ~ r1(X1)
| q4(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_296) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_295,axiom,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_295) ).
cnf(rule_183,axiom,
( ~ l2(X2,X1)
| ~ l0(c)
| ~ k1(X2)
| q2(X1,c,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_183) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_302,axiom,
( ~ k1(X1)
| ~ q4(X2,X2)
| l5(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_302) ).
cnf(prove_this,negated_conjecture,
~ l5(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(c_0_28,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_29,plain,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_082]) ).
cnf(c_0_30,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_28 ).
cnf(c_0_31,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_32,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_33,plain,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
c_0_29 ).
cnf(c_0_34,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ m3(X3,X1,X3)
| ~ m2(X2)
| ~ n2(X1)
| m3(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_228]) ).
cnf(c_0_36,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_32 ).
cnf(c_0_37,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_38,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_39,plain,
( ~ m0(X1,X1,X1)
| p1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_41,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_42,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_43,plain,
( ~ n2(X1)
| p3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_244]) ).
cnf(c_0_44,plain,
( ~ m3(X3,X1,X3)
| ~ m2(X2)
| ~ n2(X1)
| m3(X1,X2,X2) ),
c_0_35 ).
cnf(c_0_45,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_46,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_37 ).
cnf(c_0_47,plain,
( ~ k1(b)
| m2(b) ),
inference(fof_simplification,[status(thm)],[rule_136]) ).
cnf(c_0_48,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_38 ).
cnf(c_0_49,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_50,plain,
( ~ m2(X3)
| ~ m2(X4)
| ~ p1(X2,X3,X1)
| k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_201]) ).
cnf(c_0_51,plain,
p1(a,X1,a),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_52,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_41 ).
cnf(c_0_53,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_54,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_42 ).
cnf(c_0_55,plain,
( ~ p3(X2,X3,X1)
| l4(X1) ),
inference(fof_simplification,[status(thm)],[rule_277]) ).
cnf(c_0_56,plain,
( ~ n2(X1)
| p3(X1,X1,X1) ),
c_0_43 ).
cnf(c_0_57,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_58,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_59,plain,
( ~ m2(X2)
| ~ m3(X3,X1,X3)
| m3(X1,X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_60,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_45])]) ).
cnf(c_0_61,plain,
( ~ k1(b)
| m2(b) ),
c_0_47 ).
cnf(c_0_62,plain,
k1(b),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_63,plain,
( ~ m2(X3)
| ~ m2(X4)
| ~ p1(X2,X3,X1)
| k3(X1,X1,X2) ),
c_0_50 ).
cnf(c_0_64,plain,
p1(X1,X2,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_51]),c_0_40])]) ).
cnf(c_0_65,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_66,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_67,plain,
s1(b),
inference(spm,[status(thm)],[c_0_54,c_0_31]) ).
cnf(c_0_68,plain,
( ~ q4(X2,X3)
| ~ l4(X2)
| ~ r1(X1)
| q4(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_296]) ).
cnf(c_0_69,plain,
( ~ p3(X2,X3,X1)
| l4(X1) ),
c_0_55 ).
cnf(c_0_70,plain,
p3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_45])]) ).
cnf(c_0_71,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_57 ).
cnf(c_0_72,axiom,
s0(d),
axiom_1 ).
cnf(c_0_73,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_58 ).
cnf(c_0_74,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_75,plain,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_295]) ).
cnf(c_0_76,plain,
( ~ m2(X2)
| m3(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_77,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_78,plain,
( ~ m2(X3)
| ~ m2(X2)
| k3(a,a,X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_79,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_65 ).
cnf(c_0_80,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_81,plain,
( ~ q4(X2,X3)
| ~ l4(X2)
| ~ r1(X1)
| q4(X1,X1) ),
c_0_68 ).
cnf(c_0_82,plain,
l4(X1),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_83,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]) ).
cnf(c_0_84,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_85,plain,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
c_0_75 ).
cnf(c_0_86,plain,
m3(X1,b,b),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_87,plain,
( ~ m2(X2)
| k3(a,a,X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_77]) ).
cnf(c_0_88,plain,
( ~ l2(X2,X1)
| ~ l0(c)
| ~ k1(X2)
| q2(X1,c,X2) ),
inference(fof_simplification,[status(thm)],[rule_183]) ).
cnf(c_0_89,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_90,plain,
( ~ r1(X1)
| ~ q4(X2,X3)
| q4(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_91,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_53]),c_0_84])]) ).
cnf(c_0_92,plain,
( ~ q2(b,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_93,plain,
k3(a,a,X1),
inference(spm,[status(thm)],[c_0_87,c_0_77]) ).
cnf(c_0_94,plain,
( ~ l2(X2,X1)
| ~ l0(c)
| ~ k1(X2)
| q2(X1,c,X2) ),
c_0_88 ).
cnf(c_0_95,axiom,
l0(c),
axiom_24 ).
cnf(c_0_96,plain,
( ~ p0(X2,X2)
| l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_74]) ).
cnf(c_0_97,plain,
( ~ q4(X2,X3)
| q4(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).
cnf(c_0_98,plain,
( ~ q2(b,X2,X1)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_99,plain,
( ~ k1(X2)
| ~ l2(X2,X1)
| q2(X1,c,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95])]) ).
cnf(c_0_100,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_96,c_0_31]) ).
cnf(c_0_101,plain,
( ~ k1(X1)
| ~ q4(X2,X2)
| l5(X1) ),
inference(fof_simplification,[status(thm)],[rule_302]) ).
cnf(c_0_102,plain,
( ~ q2(b,X2,X3)
| q4(X1,X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_103,plain,
( ~ k1(X1)
| q2(X1,c,X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_104,negated_conjecture,
~ l5(c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_105,plain,
( ~ k1(X1)
| ~ q4(X2,X2)
| l5(X1) ),
c_0_101 ).
cnf(c_0_106,plain,
q4(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_62])]) ).
cnf(c_0_107,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_108,negated_conjecture,
~ l5(c),
c_0_104 ).
cnf(c_0_109,plain,
( ~ k1(X1)
| l5(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_106])]) ).
cnf(c_0_110,plain,
k1(c),
inference(spm,[status(thm)],[c_0_48,c_0_107]) ).
cnf(c_0_111,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN128-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 10:43:56 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.53/0.49 % Version: 3.5.1
% 0.53/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.49 % Starting sh5l with 300s (1) cores
% 0.53/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1695937 completed with status 0
% 0.53/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.53/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.49 % No SInE strategy applied
% 0.53/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.53/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.53/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.53/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.53/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.53/0.49 % SubtermCWHack with pid 1695941 completed with status 0
% 0.53/0.49 % Result found by SubtermCWHack
% 0.53/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.49 % No SInE strategy applied
% 0.53/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.53/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.49 % Preprocessing time : 0.003 s
% 0.53/0.49
% 0.53/0.49 % Proof found!
% 0.53/0.49 % SZS status Unsatisfiable
% 0.53/0.49 % SZS output start CNFRefutation
% See solution above
% 0.53/0.50 % Parsed axioms : 369
% 0.53/0.50 % Removed by relevancy pruning/SinE : 0
% 0.53/0.50 % Initial clauses : 369
% 0.53/0.50 % Removed in clause preprocessing : 7
% 0.53/0.50 % Initial clauses in saturation : 362
% 0.53/0.50 % Processed clauses : 1656
% 0.53/0.50 % ...of these trivial : 160
% 0.53/0.50 % ...subsumed : 269
% 0.53/0.50 % ...remaining for further processing : 1227
% 0.53/0.50 % Other redundant clauses eliminated : 0
% 0.53/0.50 % Clauses deleted for lack of memory : 0
% 0.53/0.50 % Backward-subsumed : 245
% 0.53/0.50 % Backward-rewritten : 362
% 0.53/0.50 % Generated clauses : 2313
% 0.53/0.50 % ...of the previous two non-redundant : 1755
% 0.53/0.50 % ...aggressively subsumed : 0
% 0.53/0.50 % Contextual simplify-reflections : 0
% 0.53/0.50 % Paramodulations : 2313
% 0.53/0.50 % Factorizations : 0
% 0.53/0.50 % NegExts : 0
% 0.53/0.50 % Equation resolutions : 0
% 0.53/0.50 % Disequality decompositions : 0
% 0.53/0.50 % Total rewrite steps : 1678
% 0.53/0.50 % ...of those cached : 1141
% 0.53/0.50 % Propositional unsat checks : 0
% 0.53/0.50 % Propositional check models : 0
% 0.53/0.50 % Propositional check unsatisfiable : 0
% 0.53/0.50 % Propositional clauses : 0
% 0.53/0.50 % Propositional clauses after purity: 0
% 0.53/0.50 % Propositional unsat core size : 0
% 0.53/0.50 % Propositional preprocessing time : 0.000
% 0.53/0.50 % Propositional encoding time : 0.000
% 0.53/0.50 % Propositional solver time : 0.000
% 0.53/0.50 % Success case prop preproc time : 0.000
% 0.53/0.50 % Success case prop encoding time : 0.000
% 0.53/0.50 % Success case prop solver time : 0.000
% 0.53/0.50 % Current number of processed clauses : 620
% 0.53/0.50 % Positive orientable unit clauses : 259
% 0.53/0.50 % Positive unorientable unit clauses: 0
% 0.53/0.50 % Negative unit clauses : 1
% 0.53/0.50 % Non-unit-clauses : 360
% 0.53/0.50 % Current number of unprocessed clauses: 164
% 0.53/0.50 % ...number of literals in the above : 594
% 0.53/0.50 % Current number of archived formulas : 0
% 0.53/0.50 % Current number of archived clauses : 607
% 0.53/0.50 % Clause-clause subsumption calls (NU) : 43867
% 0.53/0.50 % Rec. Clause-clause subsumption calls : 36654
% 0.53/0.50 % Non-unit clause-clause subsumptions : 439
% 0.53/0.50 % Unit Clause-clause subsumption calls : 4348
% 0.53/0.50 % Rewrite failures with RHS unbound : 0
% 0.53/0.50 % BW rewrite match attempts : 773
% 0.53/0.50 % BW rewrite match successes : 313
% 0.53/0.50 % Condensation attempts : 0
% 0.53/0.50 % Condensation successes : 0
% 0.53/0.50 % Termbank termtop insertions : 37290
% 0.53/0.50 % Search garbage collected termcells : 1461
% 0.53/0.50
% 0.53/0.50 % -------------------------------------------------
% 0.53/0.50 % User time : 0.055 s
% 0.53/0.50 % System time : 0.011 s
% 0.53/0.50 % Total time : 0.066 s
% 0.53/0.50 % Maximum resident set size: 4472 pages
% 0.53/0.50
% 0.53/0.50 % -------------------------------------------------
% 0.53/0.50 % User time : 0.250 s
% 0.53/0.50 % System time : 0.032 s
% 0.53/0.50 % Total time : 0.282 s
% 0.53/0.50 % Maximum resident set size: 4864 pages
% 0.53/0.50 % E exiting
%------------------------------------------------------------------------------