%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN129-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 : n009.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.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 34
% Syntax : Number of clauses : 129 ( 52 unt; 0 nHn; 106 RR)
% Number of literals : 259 ( 0 equ; 133 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 : 205 ( 65 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_021) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
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_176,axiom,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_007,axiom,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_007) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_155,axiom,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_155) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_107,axiom,
( ~ m0(e,d,X1)
| ~ m0(X1,d,X1)
| q1(e,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_107) ).
cnf(rule_192,axiom,
( ~ n0(X1,X4)
| ~ p2(X3,X2,X4)
| ~ s1(X2)
| k3(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_192) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(rule_029,axiom,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_029) ).
cnf(rule_127,axiom,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_127) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(rule_129,axiom,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_005,axiom,
( ~ m0(X2,X2,X1)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_005) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_202,axiom,
( ~ k3(X2,X5,X4)
| ~ k2(X1,X4)
| ~ q0(X3,X2)
| k3(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_202) ).
cnf(axiom_3,axiom,
n0(d,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_3) ).
cnf(axiom_11,axiom,
n0(e,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_11) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_236) ).
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(axiom_21,axiom,
q0(b,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_21) ).
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(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(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_34,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_021]) ).
cnf(c_0_35,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
c_0_34 ).
cnf(c_0_36,axiom,
k0(e),
axiom_28 ).
cnf(c_0_37,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_38,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_39,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_40,plain,
( ~ l0(X1)
| m1(X1,e,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,axiom,
l0(c),
axiom_24 ).
cnf(c_0_42,plain,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_007]) ).
cnf(c_0_43,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_37 ).
cnf(c_0_44,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_45,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_38 ).
cnf(c_0_46,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_47,plain,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_155]) ).
cnf(c_0_48,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
c_0_39 ).
cnf(c_0_49,plain,
m1(c,e,c),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_51,plain,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
c_0_42 ).
cnf(c_0_52,plain,
( ~ m0(e,d,X1)
| ~ m0(X1,d,X1)
| q1(e,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_107]) ).
cnf(c_0_53,plain,
( ~ n0(X1,X4)
| ~ p2(X3,X2,X4)
| ~ s1(X2)
| k3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_192]) ).
cnf(c_0_54,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_55,plain,
s1(b),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_56,plain,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
c_0_47 ).
cnf(c_0_57,plain,
p2(e,c,e),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_58,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_50 ).
cnf(c_0_59,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_60,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_61,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_62,plain,
( ~ r0(X1)
| m1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_46]) ).
cnf(c_0_63,axiom,
r0(e),
axiom_13 ).
cnf(c_0_64,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_65,plain,
( ~ m0(e,d,X1)
| ~ m0(X1,d,X1)
| q1(e,X1,X1) ),
c_0_52 ).
cnf(c_0_66,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_67,plain,
( ~ n0(X1,X4)
| ~ p2(X3,X2,X4)
| ~ s1(X2)
| k3(X1,X2,X1) ),
c_0_53 ).
cnf(c_0_68,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_69,plain,
( ~ k1(X1)
| p2(c,e,e) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_70,plain,
k1(c),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_71,plain,
( ~ m0(X2,X2,X1)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_005]) ).
cnf(c_0_72,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
c_0_60 ).
cnf(c_0_73,axiom,
s0(b),
axiom_5 ).
cnf(c_0_74,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
c_0_61 ).
cnf(c_0_75,plain,
m1(e,X1,e),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_76,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_64 ).
cnf(c_0_77,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66])]) ).
cnf(c_0_78,plain,
( ~ n0(X1,X4)
| ~ p2(X3,X2,X4)
| k3(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_79,plain,
p2(c,e,e),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_80,plain,
( ~ m0(X2,X2,X1)
| m1(X1,X2,X1) ),
c_0_71 ).
cnf(c_0_81,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_46]),c_0_73])]) ).
cnf(c_0_82,plain,
( ~ k1(X2)
| ~ k2(X2,X1)
| k2(e,X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_83,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_84,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_85,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_86,plain,
( ~ k3(X2,X5,X4)
| ~ k2(X1,X4)
| ~ q0(X3,X2)
| k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_202]) ).
cnf(c_0_87,plain,
( ~ n0(X1,e)
| k3(X1,e,X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_88,axiom,
n0(d,e),
axiom_3 ).
cnf(c_0_89,plain,
m1(X1,d,X1),
inference(spm,[status(thm)],[c_0_80,c_0_66]) ).
cnf(c_0_90,plain,
( ~ k1(X2)
| ~ k2(X2,X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_81]) ).
cnf(c_0_91,plain,
( ~ k1(X1)
| k2(e,X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_92,plain,
k1(e),
inference(spm,[status(thm)],[c_0_58,c_0_84]) ).
cnf(c_0_93,axiom,
n0(e,b),
axiom_11 ).
cnf(c_0_94,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_95,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_96,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_85 ).
cnf(c_0_97,plain,
( ~ k3(X2,X5,X4)
| ~ k2(X1,X4)
| ~ q0(X3,X2)
| k3(X1,X1,X2) ),
c_0_86 ).
cnf(c_0_98,plain,
k3(d,e,d),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_99,plain,
( ~ k1(X2)
| ~ k2(X2,d)
| k2(X1,d) ),
inference(spm,[status(thm)],[c_0_74,c_0_89]) ).
cnf(c_0_100,plain,
( ~ k1(X1)
| k2(b,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]) ).
cnf(c_0_101,plain,
k1(b),
inference(spm,[status(thm)],[c_0_58,c_0_93]) ).
cnf(c_0_102,plain,
k1(d),
inference(spm,[status(thm)],[c_0_58,c_0_94]) ).
cnf(c_0_103,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_104,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_95 ).
cnf(c_0_105,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_96,c_0_46]) ).
cnf(c_0_106,plain,
( ~ k2(X1,d)
| k3(X1,X1,d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_44])]) ).
cnf(c_0_107,plain,
k2(X1,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101]),c_0_102])]) ).
cnf(c_0_108,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_109,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_103 ).
cnf(c_0_110,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_111,plain,
k3(X1,X1,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_107])]) ).
cnf(c_0_112,plain,
( ~ m3(X4,X5,X4)
| ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
c_0_108 ).
cnf(c_0_113,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110])]) ).
cnf(c_0_114,plain,
( ~ q0(X3,X2)
| k3(X1,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_111]),c_0_107])]) ).
cnf(c_0_115,axiom,
q0(b,e),
axiom_21 ).
cnf(c_0_116,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_177]) ).
cnf(c_0_117,plain,
( ~ q2(X4,X2,X1)
| ~ k3(X3,X3,X1)
| q4(X1,X2) ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_118,plain,
k3(X1,X1,e),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_119,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
c_0_116 ).
cnf(c_0_120,plain,
( ~ k1(X1)
| ~ q4(X2,X2)
| l5(X1) ),
inference(fof_simplification,[status(thm)],[rule_302]) ).
cnf(c_0_121,plain,
( ~ q2(X2,X1,e)
| q4(e,X1) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_122,plain,
( ~ k0(X2)
| q2(X1,X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_105])]) ).
cnf(c_0_123,negated_conjecture,
~ l5(e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_124,plain,
( ~ k1(X1)
| ~ q4(X2,X2)
| l5(X1) ),
c_0_120 ).
cnf(c_0_125,plain,
q4(e,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_36])]) ).
cnf(c_0_126,negated_conjecture,
~ l5(e),
c_0_123 ).
cnf(c_0_127,plain,
( ~ k1(X1)
| l5(X1) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_128,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_92])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN129-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.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % 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:43:58 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.20/0.55 % Version: 3.5.1
% 0.20/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 % Starting sh5l with 300s (1) cores
% 0.20/0.55 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1543355 completed with status 0
% 0.20/0.55 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.55 % No SInE strategy applied
% 0.20/0.55 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.20/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.20/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.20/0.55 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1543364 completed with status 0
% 0.20/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.20/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.55 % No SInE strategy applied
% 0.20/0.55 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.20/0.55 % Preprocessing time : 0.003 s
% 0.20/0.55 % Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 % Proof found!
% 0.20/0.55 % SZS status Unsatisfiable
% 0.20/0.55 % SZS output start CNFRefutation
% See solution above
% 0.20/0.55 % Parsed axioms : 369
% 0.20/0.55 % Removed by relevancy pruning/SinE : 0
% 0.20/0.55 % Initial clauses : 369
% 0.20/0.55 % Removed in clause preprocessing : 7
% 0.20/0.55 % Initial clauses in saturation : 362
% 0.20/0.55 % Processed clauses : 1479
% 0.20/0.55 % ...of these trivial : 82
% 0.20/0.55 % ...subsumed : 100
% 0.20/0.55 % ...remaining for further processing : 1297
% 0.20/0.55 % Other redundant clauses eliminated : 0
% 0.20/0.55 % Clauses deleted for lack of memory : 0
% 0.20/0.55 % Backward-subsumed : 92
% 0.20/0.55 % Backward-rewritten : 332
% 0.20/0.55 % Generated clauses : 2157
% 0.20/0.55 % ...of the previous two non-redundant : 1539
% 0.20/0.55 % ...aggressively subsumed : 0
% 0.20/0.55 % Contextual simplify-reflections : 2
% 0.20/0.55 % Paramodulations : 2157
% 0.20/0.55 % Factorizations : 0
% 0.20/0.55 % NegExts : 0
% 0.20/0.55 % Equation resolutions : 0
% 0.20/0.55 % Disequality decompositions : 0
% 0.20/0.55 % Total rewrite steps : 1526
% 0.20/0.55 % ...of those cached : 1114
% 0.20/0.55 % Propositional unsat checks : 0
% 0.20/0.55 % Propositional check models : 0
% 0.20/0.55 % Propositional check unsatisfiable : 0
% 0.20/0.55 % Propositional clauses : 0
% 0.20/0.55 % Propositional clauses after purity: 0
% 0.20/0.55 % Propositional unsat core size : 0
% 0.20/0.55 % Propositional preprocessing time : 0.000
% 0.20/0.55 % Propositional encoding time : 0.000
% 0.20/0.55 % Propositional solver time : 0.000
% 0.20/0.55 % Success case prop preproc time : 0.000
% 0.20/0.55 % Success case prop encoding time : 0.000
% 0.20/0.55 % Success case prop solver time : 0.000
% 0.20/0.55 % Current number of processed clauses : 545
% 0.20/0.55 % Positive orientable unit clauses : 231
% 0.20/0.55 % Positive unorientable unit clauses: 0
% 0.20/0.55 % Negative unit clauses : 1
% 0.20/0.55 % Non-unit-clauses : 313
% 0.20/0.55 % Current number of unprocessed clauses: 371
% 0.20/0.55 % ...number of literals in the above : 1167
% 0.20/0.55 % Current number of archived formulas : 0
% 0.20/0.55 % Current number of archived clauses : 752
% 0.20/0.55 % Clause-clause subsumption calls (NU) : 60516
% 0.20/0.55 % Rec. Clause-clause subsumption calls : 45086
% 0.20/0.55 % Non-unit clause-clause subsumptions : 179
% 0.20/0.55 % Unit Clause-clause subsumption calls : 4702
% 0.20/0.55 % Rewrite failures with RHS unbound : 0
% 0.20/0.55 % BW rewrite match attempts : 766
% 0.20/0.55 % BW rewrite match successes : 233
% 0.20/0.55 % Condensation attempts : 0
% 0.20/0.55 % Condensation successes : 0
% 0.20/0.55 % Termbank termtop insertions : 37980
% 0.20/0.55 % Search garbage collected termcells : 1461
% 0.20/0.55
% 0.20/0.55 % -------------------------------------------------
% 0.20/0.55 % User time : 0.081 s
% 0.20/0.55 % System time : 0.007 s
% 0.20/0.55 % Total time : 0.088 s
% 0.20/0.55 % Maximum resident set size: 4472 pages
% 0.20/0.55
% 0.20/0.55 % -------------------------------------------------
% 0.20/0.55 % User time : 0.351 s
% 0.20/0.55 % System time : 0.037 s
% 0.20/0.55 % Total time : 0.388 s
% 0.20/0.55 % Maximum resident set size: 4864 pages
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------