%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN269-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 : 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:23:31 PM UTC 2026
% Result : Unsatisfiable 0.53s 0.51s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 31
% Syntax : Number of clauses : 118 ( 47 unt; 0 nHn; 92 RR)
% Number of literals : 235 ( 0 equ; 121 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 176 ( 66 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_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(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
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_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_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_161,axiom,
( ~ p1(d,b,e)
| p2(d,b,b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_161) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(rule_174,axiom,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_174) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(rule_267,axiom,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_267) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
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_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(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
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_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(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_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(prove_this,negated_conjecture,
~ p4(b,a,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(c_0_31,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_32,plain,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_082]) ).
cnf(c_0_33,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_31 ).
cnf(c_0_34,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_35,plain,
( ~ p1(X3,X1,X4)
| ~ m0(X3,X1,X4)
| p1(X1,X2,X3) ),
c_0_32 ).
cnf(c_0_36,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
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,
( ~ m0(X1,X1,X1)
| p1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_41,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_37 ).
cnf(c_0_42,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_43,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_38 ).
cnf(c_0_44,plain,
p1(a,X1,a),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
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_41,c_0_42]) ).
cnf(c_0_49,plain,
s1(b),
inference(spm,[status(thm)],[c_0_43,c_0_34]) ).
cnf(c_0_50,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_51,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_52,plain,
( ~ p1(d,b,e)
| p2(d,b,b) ),
inference(fof_simplification,[status(thm)],[rule_161]) ).
cnf(c_0_53,plain,
p1(X1,X2,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_44]),c_0_40])]) ).
cnf(c_0_54,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
c_0_45 ).
cnf(c_0_55,axiom,
s0(d),
axiom_1 ).
cnf(c_0_56,plain,
( ~ s1(X1)
| s1(a) ),
inference(spm,[status(thm)],[c_0_41,c_0_46]) ).
cnf(c_0_57,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_47 ).
cnf(c_0_58,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_60,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_50 ).
cnf(c_0_61,plain,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_174]) ).
cnf(c_0_62,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_51 ).
cnf(c_0_63,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_64,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_65,plain,
( ~ p1(d,b,e)
| p2(d,b,b) ),
c_0_52 ).
cnf(c_0_66,plain,
( ~ m0(X3,X1,a)
| p1(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_53]) ).
cnf(c_0_67,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_68,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_69,plain,
( ~ s1(a)
| s2(d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_70,plain,
s1(a),
inference(spm,[status(thm)],[c_0_56,c_0_49]) ).
cnf(c_0_71,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_72,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_73,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_59 ).
cnf(c_0_74,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_60,c_0_36]) ).
cnf(c_0_75,plain,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
c_0_61 ).
cnf(c_0_76,plain,
k1(e),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_77,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
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_64 ).
cnf(c_0_80,plain,
p2(d,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_81,plain,
( ~ s2(X3)
| ~ m0(X1,X4,X4)
| ~ l2(X4,X1)
| ~ m0(X3,X3,X2)
| m3(X1,X2,X1) ),
c_0_68 ).
cnf(c_0_82,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_83,plain,
( ~ p0(X2,X2)
| l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_67]) ).
cnf(c_0_84,plain,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
c_0_72 ).
cnf(c_0_85,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).
cnf(c_0_86,plain,
p2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_74]),c_0_76])]) ).
cnf(c_0_87,plain,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
inference(fof_simplification,[status(thm)],[rule_135]) ).
cnf(c_0_88,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_77 ).
cnf(c_0_89,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_90,plain,
( ~ p4(X3,X3,X4)
| ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_288]) ).
cnf(c_0_91,plain,
( ~ r3(X2,X1,X2)
| ~ r0(X1)
| p4(X1,X1,X2) ),
c_0_78 ).
cnf(c_0_92,plain,
r3(d,b,d),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_93,axiom,
r0(b),
axiom_9 ).
cnf(c_0_94,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_67]),c_0_82])]) ).
cnf(c_0_95,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_83,c_0_34]) ).
cnf(c_0_96,plain,
( ~ m2(X1)
| ~ r3(X1,X2,X2)
| r3(b,b,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_97,plain,
r3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_79,c_0_86]) ).
cnf(c_0_98,plain,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
c_0_87 ).
cnf(c_0_99,plain,
l1(c,c),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_100,plain,
( ~ k1(b)
| m2(b) ),
inference(fof_simplification,[status(thm)],[rule_136]) ).
cnf(c_0_101,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_102,negated_conjecture,
~ p4(b,a,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_103,plain,
( ~ p4(X3,X3,X4)
| ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
c_0_90 ).
cnf(c_0_104,plain,
p4(b,b,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93])]) ).
cnf(c_0_105,plain,
m3(a,X1,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_40]),c_0_95])]) ).
cnf(c_0_106,plain,
( ~ m2(X1)
| r3(b,b,X1) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_107,plain,
( ~ s0(X1)
| m2(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_108,plain,
( ~ k1(b)
| m2(b) ),
c_0_100 ).
cnf(c_0_109,plain,
k1(b),
inference(spm,[status(thm)],[c_0_62,c_0_101]) ).
cnf(c_0_110,negated_conjecture,
~ p4(b,a,a),
c_0_102 ).
cnf(c_0_111,plain,
( ~ r3(X2,X2,X1)
| p4(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_112,plain,
( ~ m2(X1)
| ~ r3(X1,X2,X2)
| r3(a,a,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_105]) ).
cnf(c_0_113,plain,
( ~ s0(X1)
| r3(b,b,X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_114,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_109])]) ).
cnf(c_0_115,axiom,
s0(b),
axiom_5 ).
cnf(c_0_116,negated_conjecture,
~ r3(a,a,b),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_117,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]),c_0_115])]),c_0_116]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN269-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.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 10:47:50 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.51 % Version: 3.5.1
% 0.53/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.51 % Starting sh5l with 300s (1) cores
% 0.53/0.51 % new_bool_1 with pid 2372177 completed with status 0
% 0.53/0.51 % Result found by new_bool_1
% 0.53/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.53/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/0.51 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.53/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.53/0.51 % SubtermCWHack with pid 2372182 completed with status 0
% 0.53/0.51 % Result found by SubtermCWHack
% 0.53/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.53/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/0.51 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.53/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.53/0.51 % Preprocessing time : 0.004 s
% 0.53/0.51
% 0.53/0.51 % Proof found!
% 0.53/0.51 % SZS status Unsatisfiable
% 0.53/0.51 % SZS output start CNFRefutation
% See solution above
% 0.53/0.51 % Parsed axioms : 369
% 0.53/0.51 % Removed by relevancy pruning/SinE : 39
% 0.53/0.51 % Initial clauses : 330
% 0.53/0.51 % Removed in clause preprocessing : 6
% 0.53/0.51 % Initial clauses in saturation : 324
% 0.53/0.51 % Processed clauses : 1248
% 0.53/0.51 % ...of these trivial : 142
% 0.53/0.51 % ...subsumed : 143
% 0.53/0.51 % ...remaining for further processing : 963
% 0.53/0.51 % Other redundant clauses eliminated : 0
% 0.53/0.51 % Clauses deleted for lack of memory : 0
% 0.53/0.51 % Backward-subsumed : 140
% 0.53/0.51 % Backward-rewritten : 282
% 0.53/0.51 % Generated clauses : 1743
% 0.53/0.51 % ...of the previous two non-redundant : 1277
% 0.53/0.51 % ...aggressively subsumed : 0
% 0.53/0.51 % Contextual simplify-reflections : 0
% 0.53/0.51 % Paramodulations : 1743
% 0.53/0.51 % Factorizations : 0
% 0.53/0.51 % NegExts : 0
% 0.53/0.51 % Equation resolutions : 0
% 0.53/0.51 % Disequality decompositions : 0
% 0.53/0.51 % Total rewrite steps : 1248
% 0.53/0.51 % ...of those cached : 806
% 0.53/0.51 % Propositional unsat checks : 0
% 0.53/0.51 % Propositional check models : 0
% 0.53/0.51 % Propositional check unsatisfiable : 0
% 0.53/0.51 % Propositional clauses : 0
% 0.53/0.51 % Propositional clauses after purity: 0
% 0.53/0.51 % Propositional unsat core size : 0
% 0.53/0.51 % Propositional preprocessing time : 0.000
% 0.53/0.51 % Propositional encoding time : 0.000
% 0.53/0.51 % Propositional solver time : 0.000
% 0.53/0.51 % Success case prop preproc time : 0.000
% 0.53/0.51 % Success case prop encoding time : 0.000
% 0.53/0.51 % Success case prop solver time : 0.000
% 0.53/0.51 % Current number of processed clauses : 541
% 0.53/0.51 % Positive orientable unit clauses : 221
% 0.53/0.51 % Positive unorientable unit clauses: 0
% 0.53/0.51 % Negative unit clauses : 2
% 0.53/0.51 % Non-unit-clauses : 318
% 0.53/0.51 % Current number of unprocessed clauses: 176
% 0.53/0.51 % ...number of literals in the above : 700
% 0.53/0.51 % Current number of archived formulas : 0
% 0.53/0.51 % Current number of archived clauses : 422
% 0.53/0.51 % Clause-clause subsumption calls (NU) : 25935
% 0.53/0.51 % Rec. Clause-clause subsumption calls : 23312
% 0.53/0.51 % Non-unit clause-clause subsumptions : 261
% 0.53/0.51 % Unit Clause-clause subsumption calls : 1797
% 0.53/0.51 % Rewrite failures with RHS unbound : 0
% 0.53/0.51 % BW rewrite match attempts : 672
% 0.53/0.51 % BW rewrite match successes : 248
% 0.53/0.51 % Condensation attempts : 0
% 0.53/0.51 % Condensation successes : 0
% 0.53/0.51 % Termbank termtop insertions : 30656
% 0.53/0.51 % Search garbage collected termcells : 1510
% 0.53/0.51
% 0.53/0.51 % -------------------------------------------------
% 0.53/0.51 % User time : 0.072 s
% 0.53/0.51 % System time : 0.012 s
% 0.53/0.51 % Total time : 0.084 s
% 0.53/0.51 % Maximum resident set size: 4472 pages
% 0.53/0.51
% 0.53/0.51 % -------------------------------------------------
% 0.53/0.51 % User time : 0.077 s
% 0.53/0.51 % System time : 0.019 s
% 0.53/0.51 % Total time : 0.096 s
% 0.53/0.51 % Maximum resident set size: 4864 pages
% 0.53/0.51 % E exiting
%------------------------------------------------------------------------------