%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN171-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 : n008.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:17 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 30
% Syntax : Number of clauses : 118 ( 42 unt; 0 nHn; 93 RR)
% Number of literals : 256 ( 0 equ; 143 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 22 ( 21 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 195 ( 66 sgn)
% Comments :
%------------------------------------------------------------------------------
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_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
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_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(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(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_190,axiom,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_190) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
cnf(rule_260,axiom,
( ~ l2(c,X1)
| ~ s2(X2)
| r3(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_260) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
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_161,axiom,
( ~ p1(d,b,e)
| p2(d,b,b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_161) ).
cnf(rule_267,axiom,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SYN001-0.ax',rule_225) ).
cnf(rule_272,axiom,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_272) ).
cnf(rule_188,axiom,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_188) ).
cnf(rule_285,axiom,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_285) ).
cnf(rule_129,axiom,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(rule_288,axiom,
( ~ p4(X3,X3,X4)
| ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_288) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(rule_268,axiom,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_268) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(prove_this,negated_conjecture,
~ p4(d,a,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(rule_135,axiom,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_135) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(c_0_30,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_31,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_32,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_33,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_30 ).
cnf(c_0_34,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_35,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_31 ).
cnf(c_0_36,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_37,plain,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_082]) ).
cnf(c_0_38,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_32 ).
cnf(c_0_39,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_40,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
s1(b),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
c_0_37 ).
cnf(c_0_43,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_44,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_39 ).
cnf(c_0_45,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( ~ m0(X1,X1,X1)
| p1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_48,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_49,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_50,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(fof_simplification,[status(thm)],[rule_190]) ).
cnf(c_0_51,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_52,plain,
p1(a,X1,a),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( ~ l2(c,X1)
| ~ s2(X2)
| r3(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_260]) ).
cnf(c_0_54,plain,
( ~ p0(X2,X2)
| l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
c_0_50 ).
cnf(c_0_56,axiom,
s0(d),
axiom_1 ).
cnf(c_0_57,plain,
( ~ s1(X1)
| s1(a) ),
inference(spm,[status(thm)],[c_0_33,c_0_51]) ).
cnf(c_0_58,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_59,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_60,plain,
( ~ p1(d,b,e)
| p2(d,b,b) ),
inference(fof_simplification,[status(thm)],[rule_161]) ).
cnf(c_0_61,plain,
p1(X1,X2,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_52]),c_0_47])]) ).
cnf(c_0_62,plain,
( ~ l2(c,X1)
| ~ s2(X2)
| r3(X1,X2,X2) ),
c_0_53 ).
cnf(c_0_63,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_54,c_0_36]) ).
cnf(c_0_64,plain,
( ~ s1(a)
| s2(d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_65,plain,
s1(a),
inference(spm,[status(thm)],[c_0_57,c_0_41]) ).
cnf(c_0_66,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_58 ).
cnf(c_0_67,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_59 ).
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(d,b,e)
| p2(d,b,b) ),
c_0_60 ).
cnf(c_0_70,plain,
( ~ m0(X3,X1,a)
| p1(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_61]) ).
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,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_272]) ).
cnf(c_0_73,plain,
( ~ s2(X1)
| r3(c,X1,X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_74,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_75,plain,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
inference(fof_simplification,[status(thm)],[rule_188]) ).
cnf(c_0_76,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_56])]) ).
cnf(c_0_77,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_67,c_0_49]) ).
cnf(c_0_78,plain,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_285]) ).
cnf(c_0_79,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
c_0_68 ).
cnf(c_0_80,plain,
p2(d,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_49])]) ).
cnf(c_0_81,plain,
( ~ s2(X3)
| ~ m0(X1,X4,X4)
| ~ l2(X4,X1)
| ~ m0(X3,X3,X2)
| m3(X1,X2,X1) ),
c_0_71 ).
cnf(c_0_82,plain,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
c_0_72 ).
cnf(c_0_83,plain,
r3(c,d,d),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_84,plain,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
c_0_75 ).
cnf(c_0_85,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_34]),c_0_77])]) ).
cnf(c_0_86,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_87,plain,
( ~ p4(X3,X3,X4)
| ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_288]) ).
cnf(c_0_88,plain,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
c_0_78 ).
cnf(c_0_89,plain,
r3(d,b,d),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_90,axiom,
r0(b),
axiom_9 ).
cnf(c_0_91,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_92,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_81,c_0_49]),c_0_74])]) ).
cnf(c_0_93,plain,
( ~ k2(X1,c)
| ~ r2(c)
| r3(d,X1,c) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_94,plain,
( ~ l0(X1)
| r2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_95,axiom,
l0(c),
axiom_24 ).
cnf(c_0_96,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_86 ).
cnf(c_0_97,negated_conjecture,
~ p4(d,a,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_98,plain,
( ~ p4(X3,X3,X4)
| ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
c_0_87 ).
cnf(c_0_99,plain,
p4(b,b,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90])]) ).
cnf(c_0_100,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_101,plain,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
c_0_91 ).
cnf(c_0_102,plain,
m3(a,X1,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_47]),c_0_63])]) ).
cnf(c_0_103,plain,
( ~ k2(X1,c)
| r3(d,X1,c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95])]) ).
cnf(c_0_104,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_96,c_0_77]) ).
cnf(c_0_105,negated_conjecture,
~ p4(d,a,a),
c_0_97 ).
cnf(c_0_106,plain,
( ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_107,plain,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
inference(fof_simplification,[status(thm)],[rule_135]) ).
cnf(c_0_108,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_100 ).
cnf(c_0_109,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_110,plain,
( ~ m2(X1)
| ~ r3(X1,X2,X2)
| r3(a,a,X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_111,plain,
r3(d,c,c),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_112,negated_conjecture,
~ r3(a,a,d),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_113,plain,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
c_0_107 ).
cnf(c_0_114,plain,
l1(c,c),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_115,plain,
~ m2(d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]) ).
cnf(c_0_116,plain,
( ~ s0(X1)
| m2(X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_117,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN171-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.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:46:10 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.20/0.54 % Version: 3.5.1
% 0.20/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 % Starting sh5l with 300s (1) cores
% 0.20/0.54 % new_bool_1 with pid 789881 completed with status 0
% 0.20/0.54 % Result found by new_bool_1
% 0.20/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.54 % SubtermCWHack with pid 789890 completed with status 0
% 0.20/0.54 % Result found by SubtermCWHack
% 0.20/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.54 % Preprocessing time : 0.005 s
% 0.20/0.54
% 0.20/0.54 % Proof found!
% 0.20/0.54 % SZS status Unsatisfiable
% 0.20/0.54 % SZS output start CNFRefutation
% See solution above
% 0.20/0.54 % Parsed axioms : 369
% 0.20/0.54 % Removed by relevancy pruning/SinE : 39
% 0.20/0.54 % Initial clauses : 330
% 0.20/0.54 % Removed in clause preprocessing : 6
% 0.20/0.54 % Initial clauses in saturation : 324
% 0.20/0.54 % Processed clauses : 1249
% 0.20/0.54 % ...of these trivial : 142
% 0.20/0.54 % ...subsumed : 143
% 0.20/0.54 % ...remaining for further processing : 964
% 0.20/0.54 % Other redundant clauses eliminated : 0
% 0.20/0.54 % Clauses deleted for lack of memory : 0
% 0.20/0.54 % Backward-subsumed : 140
% 0.20/0.54 % Backward-rewritten : 282
% 0.20/0.54 % Generated clauses : 1744
% 0.20/0.54 % ...of the previous two non-redundant : 1285
% 0.20/0.54 % ...aggressively subsumed : 0
% 0.20/0.54 % Contextual simplify-reflections : 0
% 0.20/0.54 % Paramodulations : 1744
% 0.20/0.54 % Factorizations : 0
% 0.20/0.54 % NegExts : 0
% 0.20/0.54 % Equation resolutions : 0
% 0.20/0.54 % Disequality decompositions : 0
% 0.20/0.54 % Total rewrite steps : 1256
% 0.20/0.54 % ...of those cached : 814
% 0.20/0.54 % Propositional unsat checks : 0
% 0.20/0.54 % Propositional check models : 0
% 0.20/0.54 % Propositional check unsatisfiable : 0
% 0.20/0.54 % Propositional clauses : 0
% 0.20/0.54 % Propositional clauses after purity: 0
% 0.20/0.54 % Propositional unsat core size : 0
% 0.20/0.54 % Propositional preprocessing time : 0.000
% 0.20/0.54 % Propositional encoding time : 0.000
% 0.20/0.54 % Propositional solver time : 0.000
% 0.20/0.54 % Success case prop preproc time : 0.000
% 0.20/0.54 % Success case prop encoding time : 0.000
% 0.20/0.54 % Success case prop solver time : 0.000
% 0.20/0.54 % Current number of processed clauses : 542
% 0.20/0.54 % Positive orientable unit clauses : 221
% 0.20/0.54 % Positive unorientable unit clauses: 0
% 0.20/0.54 % Negative unit clauses : 3
% 0.20/0.54 % Non-unit-clauses : 318
% 0.20/0.54 % Current number of unprocessed clauses: 186
% 0.20/0.54 % ...number of literals in the above : 722
% 0.20/0.54 % Current number of archived formulas : 0
% 0.20/0.54 % Current number of archived clauses : 422
% 0.20/0.54 % Clause-clause subsumption calls (NU) : 25935
% 0.20/0.54 % Rec. Clause-clause subsumption calls : 23312
% 0.20/0.54 % Non-unit clause-clause subsumptions : 261
% 0.20/0.54 % Unit Clause-clause subsumption calls : 1811
% 0.20/0.54 % Rewrite failures with RHS unbound : 0
% 0.20/0.54 % BW rewrite match attempts : 672
% 0.20/0.54 % BW rewrite match successes : 248
% 0.20/0.54 % Condensation attempts : 0
% 0.20/0.54 % Condensation successes : 0
% 0.20/0.54 % Termbank termtop insertions : 30659
% 0.20/0.54 % Search garbage collected termcells : 1510
% 0.20/0.54
% 0.20/0.54 % -------------------------------------------------
% 0.20/0.54 % User time : 0.075 s
% 0.20/0.54 % System time : 0.015 s
% 0.20/0.54 % Total time : 0.090 s
% 0.20/0.54 % Maximum resident set size: 4472 pages
% 0.20/0.54
% 0.20/0.54 % -------------------------------------------------
% 0.20/0.54 % User time : 0.082 s
% 0.20/0.54 % System time : 0.021 s
% 0.20/0.54 % Total time : 0.102 s
% 0.20/0.54 % Maximum resident set size: 5120 pages
% 0.20/0.54 % E exiting
%------------------------------------------------------------------------------