%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN156-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:15 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 31
% Syntax : Number of clauses : 117 ( 41 unt; 0 nHn; 101 RR)
% Number of literals : 240 ( 0 equ; 126 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 186 ( 52 sgn)
% Comments :
%------------------------------------------------------------------------------
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_024,axiom,
( ~ m1(X2,c,X2)
| ~ q0(X1,X2)
| ~ m0(a,X3,a)
| m1(X1,a,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_024) ).
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_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
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_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_021,axiom,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_021) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(rule_255,axiom,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_255) ).
cnf(rule_016,axiom,
( ~ m1(X3,X4,X2)
| ~ m1(X3,X2,X1)
| m1(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_016) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_236) ).
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_20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(rule_284,axiom,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_284) ).
cnf(rule_276,axiom,
( ~ r3(X1,e,X2)
| ~ q1(a,a,X2)
| ~ q3(X1,X1)
| k4(e) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_276) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
cnf(rule_113,axiom,
( ~ m1(X1,X2,X2)
| ~ r0(X3)
| q1(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_113) ).
cnf(rule_092,axiom,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_092) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(rule_141,axiom,
( ~ q1(X1,a,X1)
| p2(X1,a,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_141) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(rule_281,axiom,
( ~ n4(X1,X1)
| ~ p3(X1,X2,X2)
| n4(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_281) ).
cnf(rule_251,axiom,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_251) ).
cnf(prove_this,negated_conjecture,
~ n4(a,e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_31,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_32,plain,
( ~ m1(X2,c,X2)
| ~ q0(X1,X2)
| ~ m0(a,X3,a)
| m1(X1,a,X2) ),
inference(fof_simplification,[status(thm)],[rule_024]) ).
cnf(c_0_33,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_34,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
c_0_31 ).
cnf(c_0_35,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_36,axiom,
s0(b),
axiom_5 ).
cnf(c_0_37,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_38,plain,
( ~ m1(X2,c,X2)
| ~ q0(X1,X2)
| ~ m0(a,X3,a)
| m1(X1,a,X2) ),
c_0_32 ).
cnf(c_0_39,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_40,plain,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_155]) ).
cnf(c_0_41,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
c_0_33 ).
cnf(c_0_42,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_43,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_44,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_177]) ).
cnf(c_0_45,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_37 ).
cnf(c_0_46,plain,
( ~ q0(X1,X2)
| ~ m1(X2,c,X2)
| m1(X1,a,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_47,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_021]) ).
cnf(c_0_48,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_49,plain,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
c_0_40 ).
cnf(c_0_50,plain,
p2(X1,b,X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_43 ).
cnf(c_0_52,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_53,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_255]) ).
cnf(c_0_54,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
c_0_44 ).
cnf(c_0_55,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_56,plain,
( ~ m1(X3,X4,X2)
| ~ m1(X3,X2,X1)
| m1(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_016]) ).
cnf(c_0_57,plain,
( ~ q0(X1,b)
| m1(X1,a,b) ),
inference(spm,[status(thm)],[c_0_46,c_0_42]) ).
cnf(c_0_58,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_59,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
c_0_47 ).
cnf(c_0_60,axiom,
k0(b),
axiom_32 ).
cnf(c_0_61,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_62,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_48 ).
cnf(c_0_63,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_64,plain,
( ~ k1(X1)
| p2(b,e,e) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_65,plain,
k1(c),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_66,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
c_0_53 ).
cnf(c_0_67,plain,
( ~ k0(X2)
| q2(X1,X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_68,plain,
( ~ m1(X3,X4,X2)
| ~ m1(X3,X2,X1)
| m1(X1,X2,X2) ),
c_0_56 ).
cnf(c_0_69,plain,
m1(a,a,b),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_70,plain,
( ~ l0(X1)
| m1(X1,b,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_71,axiom,
l0(a),
axiom_20 ).
cnf(c_0_72,plain,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_284]) ).
cnf(c_0_73,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_61 ).
cnf(c_0_74,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_62,c_0_55]) ).
cnf(c_0_75,plain,
( ~ r3(X1,e,X2)
| ~ q1(a,a,X2)
| ~ q3(X1,X1)
| k4(e) ),
inference(fof_simplification,[status(thm)],[rule_276]) ).
cnf(c_0_76,plain,
( ~ p2(X1,X3,X2)
| r3(X1,X2,X1) ),
c_0_63 ).
cnf(c_0_77,plain,
p2(b,e,e),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_78,plain,
( ~ n0(X2,X1)
| ~ k0(X1)
| q3(X1,X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_79,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_80,plain,
( ~ m1(X1,X2,X2)
| ~ r0(X3)
| q1(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_113]) ).
cnf(c_0_81,plain,
( ~ m1(a,b,X1)
| m1(X1,b,b) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_82,plain,
m1(a,b,a),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_83,plain,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_092]) ).
cnf(c_0_84,plain,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
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,
( ~ r3(X1,e,X2)
| ~ q1(a,a,X2)
| ~ q3(X1,X1)
| k4(e) ),
c_0_75 ).
cnf(c_0_87,plain,
r3(b,e,b),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_88,plain,
q3(b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_60])]) ).
cnf(c_0_89,plain,
( ~ m1(X1,X2,X2)
| ~ r0(X3)
| q1(X1,X1,X2) ),
c_0_80 ).
cnf(c_0_90,plain,
m1(a,b,b),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_91,plain,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
c_0_83 ).
cnf(c_0_92,plain,
( ~ k4(X2)
| n4(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_93,plain,
( ~ q1(a,a,b)
| k4(e) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88])]) ).
cnf(c_0_94,plain,
( ~ r0(X1)
| q1(a,a,b) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_95,axiom,
r0(b),
axiom_9 ).
cnf(c_0_96,plain,
( ~ q1(X1,a,X1)
| p2(X1,a,X1) ),
inference(fof_simplification,[status(thm)],[rule_141]) ).
cnf(c_0_97,plain,
( ~ n0(X3,X2)
| q1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_35]) ).
cnf(c_0_98,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_99,plain,
( ~ n4(X1,X1)
| ~ p3(X1,X2,X2)
| n4(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_281]) ).
cnf(c_0_100,plain,
( ~ q1(a,a,b)
| n4(X1,X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_101,plain,
q1(a,a,b),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_102,plain,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_251]) ).
cnf(c_0_103,plain,
( ~ q1(X1,a,X1)
| p2(X1,a,X1) ),
c_0_96 ).
cnf(c_0_104,plain,
q1(X1,a,X1),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_105,plain,
( ~ n4(X1,X1)
| ~ p3(X1,X2,X2)
| n4(X1,X2) ),
c_0_99 ).
cnf(c_0_106,plain,
n4(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_101])]) ).
cnf(c_0_107,plain,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
c_0_102 ).
cnf(c_0_108,plain,
p2(X1,a,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]) ).
cnf(c_0_109,plain,
( ~ p3(X1,X2,X2)
| n4(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_106])]) ).
cnf(c_0_110,plain,
( ~ p2(X1,X2,X2)
| p3(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_107,c_0_85]) ).
cnf(c_0_111,plain,
( ~ k1(X1)
| p2(a,e,e) ),
inference(spm,[status(thm)],[c_0_49,c_0_108]) ).
cnf(c_0_112,negated_conjecture,
~ n4(a,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_113,plain,
( ~ p2(X1,X2,X2)
| n4(X1,X2) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_114,plain,
p2(a,e,e),
inference(spm,[status(thm)],[c_0_111,c_0_65]) ).
cnf(c_0_115,negated_conjecture,
~ n4(a,e),
c_0_112 ).
cnf(c_0_116,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN156-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 : n008.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.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 10:45:53 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.17/0.49 % Version: 3.5.1
% 0.17/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 % Starting sh5l with 300s (1) cores
% 0.17/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 789023 completed with status 0
% 0.17/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.49 % No SInE strategy applied
% 0.17/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.17/0.49 % SubtermCWHack with pid 789027 completed with status 0
% 0.17/0.49 % Result found by SubtermCWHack
% 0.17/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.49 % No SInE strategy applied
% 0.17/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.49 % Preprocessing time : 0.003 s
% 0.17/0.49
% 0.17/0.49 % Proof found!
% 0.17/0.49 % SZS status Unsatisfiable
% 0.17/0.49 % SZS output start CNFRefutation
% See solution above
% 0.17/0.49 % Parsed axioms : 369
% 0.17/0.49 % Removed by relevancy pruning/SinE : 0
% 0.17/0.49 % Initial clauses : 369
% 0.17/0.49 % Removed in clause preprocessing : 7
% 0.17/0.49 % Initial clauses in saturation : 362
% 0.17/0.49 % Processed clauses : 1362
% 0.17/0.49 % ...of these trivial : 145
% 0.17/0.49 % ...subsumed : 202
% 0.17/0.49 % ...remaining for further processing : 1015
% 0.17/0.49 % Other redundant clauses eliminated : 0
% 0.17/0.49 % Clauses deleted for lack of memory : 0
% 0.17/0.49 % Backward-subsumed : 159
% 0.17/0.49 % Backward-rewritten : 282
% 0.17/0.49 % Generated clauses : 1797
% 0.17/0.49 % ...of the previous two non-redundant : 1384
% 0.17/0.49 % ...aggressively subsumed : 0
% 0.17/0.49 % Contextual simplify-reflections : 0
% 0.17/0.49 % Paramodulations : 1797
% 0.17/0.49 % Factorizations : 0
% 0.17/0.49 % NegExts : 0
% 0.17/0.49 % Equation resolutions : 0
% 0.17/0.49 % Disequality decompositions : 0
% 0.17/0.49 % Total rewrite steps : 1308
% 0.17/0.49 % ...of those cached : 884
% 0.17/0.49 % Propositional unsat checks : 0
% 0.17/0.49 % Propositional check models : 0
% 0.17/0.49 % Propositional check unsatisfiable : 0
% 0.17/0.49 % Propositional clauses : 0
% 0.17/0.49 % Propositional clauses after purity: 0
% 0.17/0.49 % Propositional unsat core size : 0
% 0.17/0.49 % Propositional preprocessing time : 0.000
% 0.17/0.49 % Propositional encoding time : 0.000
% 0.17/0.49 % Propositional solver time : 0.000
% 0.17/0.49 % Success case prop preproc time : 0.000
% 0.17/0.49 % Success case prop encoding time : 0.000
% 0.17/0.49 % Success case prop solver time : 0.000
% 0.17/0.49 % Current number of processed clauses : 574
% 0.17/0.49 % Positive orientable unit clauses : 242
% 0.17/0.49 % Positive unorientable unit clauses: 0
% 0.17/0.49 % Negative unit clauses : 4
% 0.17/0.49 % Non-unit-clauses : 328
% 0.17/0.49 % Current number of unprocessed clauses: 218
% 0.17/0.49 % ...number of literals in the above : 790
% 0.17/0.49 % Current number of archived formulas : 0
% 0.17/0.49 % Current number of archived clauses : 441
% 0.17/0.49 % Clause-clause subsumption calls (NU) : 31815
% 0.17/0.49 % Rec. Clause-clause subsumption calls : 26117
% 0.17/0.49 % Non-unit clause-clause subsumptions : 279
% 0.17/0.49 % Unit Clause-clause subsumption calls : 2869
% 0.17/0.49 % Rewrite failures with RHS unbound : 0
% 0.17/0.49 % BW rewrite match attempts : 622
% 0.17/0.49 % BW rewrite match successes : 232
% 0.17/0.49 % Condensation attempts : 0
% 0.17/0.49 % Condensation successes : 0
% 0.17/0.49 % Termbank termtop insertions : 31715
% 0.17/0.49 % Search garbage collected termcells : 1461
% 0.17/0.49
% 0.17/0.49 % -------------------------------------------------
% 0.17/0.49 % User time : 0.047 s
% 0.17/0.49 % System time : 0.010 s
% 0.17/0.49 % Total time : 0.057 s
% 0.17/0.49 % Maximum resident set size: 4472 pages
% 0.17/0.49
% 0.17/0.49 % -------------------------------------------------
% 0.17/0.49 % User time : 0.194 s
% 0.17/0.49 % System time : 0.037 s
% 0.17/0.49 % Total time : 0.231 s
% 0.17/0.49 % Maximum resident set size: 5120 pages
% 0.17/0.49 % E exiting
%------------------------------------------------------------------------------