%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN269-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 : n019.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:55 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 34
% Syntax : Number of clauses : 123 ( 52 unt; 0 nHn; 104 RR)
% Number of literals : 243 ( 0 equ; 124 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 171 ( 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_063,axiom,
( ~ k0(X2)
| ~ n0(d,X1)
| p1(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_063) ).
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_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_145,axiom,
( ~ p1(X1,X2,e)
| ~ r0(e)
| p2(e,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_145) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(rule_190,axiom,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_190) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
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_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(rule_174,axiom,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_174) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(rule_267,axiom,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_267) ).
cnf(rule_225,axiom,
( ~ s2(X3)
| ~ m0(X1,X4,X4)
| ~ l2(X4,X1)
| ~ m0(X3,X3,X2)
| m3(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_225) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_268,axiom,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_268) ).
cnf(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(rule_285,axiom,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_285) ).
cnf(rule_135,axiom,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_135) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(rule_288,axiom,
( ~ p4(X3,X3,X4)
| ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_288) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
cnf(rule_136,axiom,
( ~ k1(b)
| m2(b) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_136) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
cnf(prove_this,negated_conjecture,
~ p4(b,a,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(c_0_34,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_35,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_36,plain,
( ~ k0(X2)
| ~ n0(d,X1)
| p1(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_063]) ).
cnf(c_0_37,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_34 ).
cnf(c_0_38,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_39,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_35 ).
cnf(c_0_40,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_41,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_42,plain,
( ~ p1(X1,X2,e)
| ~ r0(e)
| p2(e,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_145]) ).
cnf(c_0_43,plain,
( ~ k0(X2)
| ~ n0(d,X1)
| p1(X1,X1,X2) ),
c_0_36 ).
cnf(c_0_44,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_45,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(fof_simplification,[status(thm)],[rule_190]) ).
cnf(c_0_46,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_47,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_48,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_49,plain,
s1(b),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_50,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_51,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_41 ).
cnf(c_0_52,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_53,plain,
( ~ p1(X1,X2,e)
| ~ r0(e)
| p2(e,X1,X2) ),
c_0_42 ).
cnf(c_0_54,axiom,
r0(e),
axiom_13 ).
cnf(c_0_55,plain,
( ~ k0(X1)
| p1(b,b,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_56,axiom,
k0(e),
axiom_28 ).
cnf(c_0_57,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
c_0_45 ).
cnf(c_0_58,axiom,
s0(d),
axiom_1 ).
cnf(c_0_59,plain,
( ~ s1(X1)
| s1(a) ),
inference(spm,[status(thm)],[c_0_37,c_0_46]) ).
cnf(c_0_60,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_47 ).
cnf(c_0_61,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_62,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_63,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_50 ).
cnf(c_0_64,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_51,c_0_40]) ).
cnf(c_0_65,plain,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_174]) ).
cnf(c_0_66,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_52 ).
cnf(c_0_67,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_68,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_69,plain,
( ~ p1(X1,X2,e)
| p2(e,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_70,plain,
p1(b,b,e),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_71,plain,
( ~ s2(X3)
| ~ m0(X1,X4,X4)
| ~ l2(X4,X1)
| ~ m0(X3,X3,X2)
| m3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_225]) ).
cnf(c_0_72,plain,
( ~ s1(a)
| s2(d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_73,plain,
s1(a),
inference(spm,[status(thm)],[c_0_59,c_0_49]) ).
cnf(c_0_74,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_75,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_76,plain,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_268]) ).
cnf(c_0_77,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_62 ).
cnf(c_0_78,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_79,plain,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
c_0_65 ).
cnf(c_0_80,plain,
k1(e),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_81,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_82,plain,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_285]) ).
cnf(c_0_83,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
c_0_68 ).
cnf(c_0_84,plain,
p2(e,b,b),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_85,plain,
( ~ s2(X3)
| ~ m0(X1,X4,X4)
| ~ l2(X4,X1)
| ~ m0(X3,X3,X2)
| m3(X1,X2,X1) ),
c_0_71 ).
cnf(c_0_86,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_87,plain,
( ~ p0(X2,X2)
| l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_88,plain,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
c_0_76 ).
cnf(c_0_89,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_90,plain,
p2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_78]),c_0_80])]) ).
cnf(c_0_91,plain,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
inference(fof_simplification,[status(thm)],[rule_135]) ).
cnf(c_0_92,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_81 ).
cnf(c_0_93,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_94,plain,
( ~ p4(X3,X3,X4)
| ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_288]) ).
cnf(c_0_95,plain,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
c_0_82 ).
cnf(c_0_96,plain,
r3(e,b,e),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_97,axiom,
r0(b),
axiom_9 ).
cnf(c_0_98,plain,
( ~ m0(X1,X3,X3)
| ~ l2(X3,X1)
| m3(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_75]),c_0_86])]) ).
cnf(c_0_99,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_100,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_87,c_0_40]) ).
cnf(c_0_101,plain,
( ~ m2(X1)
| ~ r3(X1,X2,X2)
| r3(b,b,X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_102,plain,
r3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_83,c_0_90]) ).
cnf(c_0_103,plain,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
c_0_91 ).
cnf(c_0_104,plain,
l1(c,c),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_105,plain,
( ~ k1(b)
| m2(b) ),
inference(fof_simplification,[status(thm)],[rule_136]) ).
cnf(c_0_106,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_107,negated_conjecture,
~ p4(b,a,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_108,plain,
( ~ p4(X3,X3,X4)
| ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
c_0_94 ).
cnf(c_0_109,plain,
p4(b,b,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97])]) ).
cnf(c_0_110,plain,
m3(a,X1,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100])]) ).
cnf(c_0_111,plain,
( ~ m2(X1)
| r3(b,b,X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_112,plain,
( ~ s0(X1)
| m2(X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_113,plain,
( ~ k1(b)
| m2(b) ),
c_0_105 ).
cnf(c_0_114,plain,
k1(b),
inference(spm,[status(thm)],[c_0_66,c_0_106]) ).
cnf(c_0_115,negated_conjecture,
~ p4(b,a,a),
c_0_107 ).
cnf(c_0_116,plain,
( ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_117,plain,
( ~ m2(X1)
| ~ r3(X1,X2,X2)
| r3(a,a,X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_110]) ).
cnf(c_0_118,plain,
( ~ s0(X1)
| r3(b,b,X1) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_119,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_114])]) ).
cnf(c_0_120,axiom,
s0(b),
axiom_5 ).
cnf(c_0_121,negated_conjecture,
~ r3(a,a,b),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_122,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_120])]),c_0_121]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN269-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.11/0.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 10:47:50 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.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.21/0.53 % Version: 3.5.1
% 0.21/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 % Starting sh5l with 300s (1) cores
% 0.21/0.53 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2372203 completed with status 0
% 0.21/0.53 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.53 % No SInE strategy applied
% 0.21/0.53 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.21/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.21/0.53 % Starting new_bool_1 with 136s (1) cores
% 0.21/0.53 % SubtermCWHack with pid 2372207 completed with status 0
% 0.21/0.53 % Result found by SubtermCWHack
% 0.21/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.53 % No SInE strategy applied
% 0.21/0.53 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.53 % Preprocessing time : 0.003 s
% 0.21/0.53
% 0.21/0.53 % Proof found!
% 0.21/0.53 % SZS status Unsatisfiable
% 0.21/0.53 % SZS output start CNFRefutation
% See solution above
% 0.21/0.53 % Parsed axioms : 369
% 0.21/0.53 % Removed by relevancy pruning/SinE : 0
% 0.21/0.53 % Initial clauses : 369
% 0.21/0.53 % Removed in clause preprocessing : 7
% 0.21/0.53 % Initial clauses in saturation : 362
% 0.21/0.53 % Processed clauses : 1608
% 0.21/0.53 % ...of these trivial : 157
% 0.21/0.53 % ...subsumed : 256
% 0.21/0.53 % ...remaining for further processing : 1195
% 0.21/0.53 % Other redundant clauses eliminated : 0
% 0.21/0.53 % Clauses deleted for lack of memory : 0
% 0.21/0.53 % Backward-subsumed : 234
% 0.21/0.53 % Backward-rewritten : 352
% 0.21/0.53 % Generated clauses : 2242
% 0.21/0.53 % ...of the previous two non-redundant : 1691
% 0.21/0.53 % ...aggressively subsumed : 0
% 0.21/0.53 % Contextual simplify-reflections : 0
% 0.21/0.53 % Paramodulations : 2242
% 0.21/0.53 % Factorizations : 0
% 0.21/0.53 % NegExts : 0
% 0.21/0.53 % Equation resolutions : 0
% 0.21/0.53 % Disequality decompositions : 0
% 0.21/0.53 % Total rewrite steps : 1616
% 0.21/0.53 % ...of those cached : 1088
% 0.21/0.53 % Propositional unsat checks : 0
% 0.21/0.53 % Propositional check models : 0
% 0.21/0.53 % Propositional check unsatisfiable : 0
% 0.21/0.53 % Propositional clauses : 0
% 0.21/0.53 % Propositional clauses after purity: 0
% 0.21/0.53 % Propositional unsat core size : 0
% 0.21/0.53 % Propositional preprocessing time : 0.000
% 0.21/0.53 % Propositional encoding time : 0.000
% 0.21/0.53 % Propositional solver time : 0.000
% 0.21/0.53 % Success case prop preproc time : 0.000
% 0.21/0.53 % Success case prop encoding time : 0.000
% 0.21/0.53 % Success case prop solver time : 0.000
% 0.21/0.53 % Current number of processed clauses : 609
% 0.21/0.53 % Positive orientable unit clauses : 253
% 0.21/0.53 % Positive unorientable unit clauses: 0
% 0.21/0.53 % Negative unit clauses : 2
% 0.21/0.53 % Non-unit-clauses : 354
% 0.21/0.53 % Current number of unprocessed clauses: 160
% 0.21/0.53 % ...number of literals in the above : 606
% 0.21/0.53 % Current number of archived formulas : 0
% 0.21/0.53 % Current number of archived clauses : 586
% 0.21/0.53 % Clause-clause subsumption calls (NU) : 42587
% 0.21/0.53 % Rec. Clause-clause subsumption calls : 35590
% 0.21/0.53 % Non-unit clause-clause subsumptions : 416
% 0.21/0.53 % Unit Clause-clause subsumption calls : 3986
% 0.21/0.53 % Rewrite failures with RHS unbound : 0
% 0.21/0.53 % BW rewrite match attempts : 760
% 0.21/0.53 % BW rewrite match successes : 309
% 0.21/0.53 % Condensation attempts : 0
% 0.21/0.53 % Condensation successes : 0
% 0.21/0.53 % Termbank termtop insertions : 36687
% 0.21/0.53 % Search garbage collected termcells : 1461
% 0.21/0.53
% 0.21/0.53 % -------------------------------------------------
% 0.21/0.53 % User time : 0.057 s
% 0.21/0.53 % System time : 0.008 s
% 0.21/0.53 % Total time : 0.064 s
% 0.21/0.53 % Maximum resident set size: 4472 pages
% 0.21/0.53
% 0.21/0.53 % -------------------------------------------------
% 0.21/0.53 % User time : 0.228 s
% 0.21/0.53 % System time : 0.027 s
% 0.21/0.53 % Total time : 0.255 s
% 0.21/0.53 % Maximum resident set size: 4864 pages
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------