TSTP Solution File: SYN163-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN163-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:29:27 EDT 2023
% Result : Unsatisfiable 1.17s 0.64s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 45
% Syntax : Number of clauses : 143 ( 54 unt; 0 nHn; 108 RR)
% Number of literals : 291 ( 0 equ; 151 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 31 ( 30 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 223 ( 81 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_021) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_28) ).
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_14) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_20) ).
cnf(rule_088,axiom,
( p1(a,a,a)
| ~ l0(a) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_088) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_176) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_133) ).
cnf(rule_082,axiom,
( p1(X1,X2,X3)
| ~ m0(X3,X1,X4)
| ~ p1(X3,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_082) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_12) ).
cnf(rule_155,axiom,
( p2(X1,X2,X2)
| ~ k1(X3)
| ~ p2(e,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_155) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_001) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_26) ).
cnf(axiom_11,axiom,
n0(e,b),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_11) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_19) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_085) ).
cnf(rule_136,axiom,
( m2(b)
| ~ k1(b) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_136) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_137) ).
cnf(rule_201,axiom,
( k3(X1,X1,X2)
| ~ p1(X2,X3,X1)
| ~ m2(X4)
| ~ m2(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_201) ).
cnf(rule_267,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_267) ).
cnf(rule_316,axiom,
( n5(X1,X1)
| ~ p4(X2,X1,X1)
| ~ s1(X1)
| ~ p4(b,b,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_316) ).
cnf(rule_212,axiom,
( k3(X1,X1,X1)
| ~ m2(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_212) ).
cnf(rule_246,axiom,
( p3(X1,X1,X1)
| ~ l2(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_246) ).
cnf(rule_236,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_236) ).
cnf(rule_285,axiom,
( p4(X1,X1,X2)
| ~ r0(X1)
| ~ r3(X2,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_285) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_13) ).
cnf(rule_287,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_287) ).
cnf(rule_291,axiom,
( p4(X1,X1,X1)
| ~ p3(X2,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_291) ).
cnf(rule_295,axiom,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_295) ).
cnf(rule_288,axiom,
( p4(X1,X2,X2)
| ~ r3(X2,X2,X1)
| ~ p4(X3,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_288) ).
cnf(rule_265,axiom,
( r3(X1,X1,X1)
| ~ l2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_265) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_181) ).
cnf(rule_100,axiom,
( q1(X1,X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_100) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_37) ).
cnf(rule_307,axiom,
( n5(X1,X2)
| ~ q4(X3,X4)
| ~ n4(X1,X4)
| ~ p4(X5,X5,X2)
| ~ n5(X5,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_307) ).
cnf(rule_284,axiom,
( n4(X1,X1)
| ~ k4(X2)
| ~ m3(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_284) ).
cnf(rule_276,axiom,
( k4(e)
| ~ q3(X1,X1)
| ~ q1(a,a,X2)
| ~ r3(X1,e,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_276) ).
cnf(rule_258,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_258) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_124) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',axiom_1) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_117) ).
cnf(prove_this,negated_conjecture,
~ n5(e,a),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',prove_this) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p',rule_188) ).
cnf(c_0_45,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
rule_021 ).
cnf(c_0_46,axiom,
k0(e),
axiom_28 ).
cnf(c_0_47,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_48,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_49,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_50,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_51,plain,
( m1(X1,e,X1)
| ~ l0(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,axiom,
l0(a),
axiom_20 ).
cnf(c_0_53,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
s1(b),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,axiom,
( p1(a,a,a)
| ~ l0(a) ),
rule_088 ).
cnf(c_0_56,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
rule_176 ).
cnf(c_0_57,plain,
m1(a,e,a),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_59,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,axiom,
( p1(X1,X2,X3)
| ~ m0(X3,X1,X4)
| ~ p1(X3,X1,X4) ),
rule_082 ).
cnf(c_0_61,plain,
p1(a,a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_52])]) ).
cnf(c_0_62,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_63,axiom,
( p2(X1,X2,X2)
| ~ k1(X3)
| ~ p2(e,X1,X2) ),
rule_155 ).
cnf(c_0_64,plain,
p2(e,a,e),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_65,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_66,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_67,axiom,
n0(e,b),
axiom_11 ).
cnf(c_0_68,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_69,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_70,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_71,plain,
p1(a,X1,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_72,plain,
( p2(a,e,e)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_73,plain,
k1(c),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,axiom,
( m2(b)
| ~ k1(b) ),
rule_136 ).
cnf(c_0_75,plain,
k1(b),
inference(spm,[status(thm)],[c_0_65,c_0_67]) ).
cnf(c_0_76,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_77,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
rule_137 ).
cnf(c_0_78,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_70,c_0_50]) ).
cnf(c_0_79,axiom,
( k3(X1,X1,X2)
| ~ p1(X2,X3,X1)
| ~ m2(X4)
| ~ m2(X3) ),
rule_201 ).
cnf(c_0_80,plain,
p1(X1,X2,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_71]),c_0_62])]) ).
cnf(c_0_81,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
rule_267 ).
cnf(c_0_82,plain,
p2(a,e,e),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_83,axiom,
( n5(X1,X1)
| ~ p4(X2,X1,X1)
| ~ s1(X1)
| ~ p4(b,b,X3) ),
rule_316 ).
cnf(c_0_84,axiom,
( k3(X1,X1,X1)
| ~ m2(X1) ),
rule_212 ).
cnf(c_0_85,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_86,axiom,
( p3(X1,X1,X1)
| ~ l2(X1,X1) ),
rule_246 ).
cnf(c_0_87,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_76,c_0_50]) ).
cnf(c_0_88,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
rule_236 ).
cnf(c_0_89,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_90,plain,
( k3(a,a,X1)
| ~ m2(X2)
| ~ m2(X3) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_91,axiom,
( p4(X1,X1,X2)
| ~ r0(X1)
| ~ r3(X2,X1,X2) ),
rule_285 ).
cnf(c_0_92,plain,
r3(a,e,a),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_93,axiom,
r0(e),
axiom_13 ).
cnf(c_0_94,plain,
( n5(X1,X1)
| ~ p4(b,b,X2)
| ~ p4(X3,X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_59])]) ).
cnf(c_0_95,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
rule_287 ).
cnf(c_0_96,plain,
k3(b,b,b),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_97,axiom,
( p4(X1,X1,X1)
| ~ p3(X2,X2,X1) ),
rule_291 ).
cnf(c_0_98,plain,
p3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).
cnf(c_0_99,axiom,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
rule_295 ).
cnf(c_0_100,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_89])]) ).
cnf(c_0_101,plain,
( k3(a,a,X1)
| ~ m2(X2) ),
inference(spm,[status(thm)],[c_0_90,c_0_85]) ).
cnf(c_0_102,axiom,
( p4(X1,X2,X2)
| ~ r3(X2,X2,X1)
| ~ p4(X3,X3,X4) ),
rule_288 ).
cnf(c_0_103,plain,
p4(e,e,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93])]) ).
cnf(c_0_104,plain,
( n5(X1,X1)
| ~ p4(X2,X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96])]) ).
cnf(c_0_105,plain,
p4(X1,X1,X1),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_106,axiom,
( r3(X1,X1,X1)
| ~ l2(X2,X1) ),
rule_265 ).
cnf(c_0_107,plain,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_108,plain,
k3(a,a,X1),
inference(spm,[status(thm)],[c_0_101,c_0_85]) ).
cnf(c_0_109,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
rule_181 ).
cnf(c_0_110,axiom,
( q1(X1,X1,X1)
| ~ n0(X2,X1) ),
rule_100 ).
cnf(c_0_111,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_112,axiom,
( n5(X1,X2)
| ~ q4(X3,X4)
| ~ n4(X1,X4)
| ~ p4(X5,X5,X2)
| ~ n5(X5,X2) ),
rule_307 ).
cnf(c_0_113,plain,
( p4(X1,X2,X2)
| ~ r3(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_114,plain,
n5(X1,X1),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_115,plain,
r3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_106,c_0_87]) ).
cnf(c_0_116,plain,
( q4(X1,X2)
| ~ q2(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_117,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_78])]) ).
cnf(c_0_118,axiom,
( n4(X1,X1)
| ~ k4(X2)
| ~ m3(X1,X1,X1) ),
rule_284 ).
cnf(c_0_119,axiom,
( k4(e)
| ~ q3(X1,X1)
| ~ q1(a,a,X2)
| ~ r3(X1,e,X2) ),
rule_276 ).
cnf(c_0_120,plain,
q1(a,a,a),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_121,plain,
( n5(X1,X2)
| ~ q4(X3,X4)
| ~ n4(X1,X4) ),
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])]) ).
cnf(c_0_122,plain,
q4(X1,X1),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_123,plain,
( n4(X1,X1)
| ~ k4(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_100])]) ).
cnf(c_0_124,plain,
( k4(e)
| ~ q3(a,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_92]),c_0_120])]) ).
cnf(c_0_125,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
rule_258 ).
cnf(c_0_126,plain,
( n5(X1,X2)
| ~ n4(X1,X3) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_127,plain,
( n4(X1,X1)
| ~ q3(a,a) ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_128,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ l2(X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_59])]) ).
cnf(c_0_129,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_130,axiom,
s0(d),
axiom_1 ).
cnf(c_0_131,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_132,plain,
( n5(X1,X2)
| ~ q3(a,a) ),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_133,plain,
( q3(X1,X1)
| ~ r2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_87])]) ).
cnf(c_0_134,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_130])]) ).
cnf(c_0_135,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_130]),c_0_46])]) ).
cnf(c_0_136,negated_conjecture,
~ n5(e,a),
prove_this ).
cnf(c_0_137,plain,
( n5(X1,X2)
| ~ r2(a) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_138,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
rule_188 ).
cnf(c_0_139,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_48]),c_0_135])]) ).
cnf(c_0_140,negated_conjecture,
~ r2(a),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_141,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139])]) ).
cnf(c_0_142,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN163-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:34:04 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.j4vg5pRs2Z/E---3.1_2034.p
% 1.17/0.64 # Version: 3.1pre001
% 1.17/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.17/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.17/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.17/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.17/0.64 # Starting sh5l with 300s (1) cores
% 1.17/0.64 # new_bool_1 with pid 2126 completed with status 0
% 1.17/0.64 # Result found by new_bool_1
% 1.17/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.17/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.17/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.17/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.17/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.17/0.64 # Search class: FHUNM-FSLM00-SFFFFFNN
% 1.17/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.17/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.17/0.64 # SAT001_MinMin_p005000_rr_RG with pid 2134 completed with status 0
% 1.17/0.64 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.17/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.17/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.17/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.17/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.17/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.17/0.64 # Search class: FHUNM-FSLM00-SFFFFFNN
% 1.17/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.17/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.17/0.64 # Preprocessing time : 0.005 s
% 1.17/0.64 # Presaturation interreduction done
% 1.17/0.64
% 1.17/0.64 # Proof found!
% 1.17/0.64 # SZS status Unsatisfiable
% 1.17/0.64 # SZS output start CNFRefutation
% See solution above
% 1.17/0.64 # Parsed axioms : 369
% 1.17/0.64 # Removed by relevancy pruning/SinE : 26
% 1.17/0.64 # Initial clauses : 343
% 1.17/0.64 # Removed in clause preprocessing : 6
% 1.17/0.64 # Initial clauses in saturation : 337
% 1.17/0.64 # Processed clauses : 1407
% 1.17/0.64 # ...of these trivial : 66
% 1.17/0.64 # ...subsumed : 108
% 1.17/0.64 # ...remaining for further processing : 1233
% 1.17/0.64 # Other redundant clauses eliminated : 0
% 1.17/0.64 # Clauses deleted for lack of memory : 0
% 1.17/0.64 # Backward-subsumed : 87
% 1.17/0.64 # Backward-rewritten : 346
% 1.17/0.64 # Generated clauses : 2090
% 1.17/0.64 # ...of the previous two non-redundant : 1532
% 1.17/0.64 # ...aggressively subsumed : 0
% 1.17/0.64 # Contextual simplify-reflections : 2
% 1.17/0.64 # Paramodulations : 2090
% 1.17/0.64 # Factorizations : 0
% 1.17/0.64 # NegExts : 0
% 1.17/0.64 # Equation resolutions : 0
% 1.17/0.64 # Total rewrite steps : 1444
% 1.17/0.64 # Propositional unsat checks : 0
% 1.17/0.64 # Propositional check models : 0
% 1.17/0.64 # Propositional check unsatisfiable : 0
% 1.17/0.64 # Propositional clauses : 0
% 1.17/0.64 # Propositional clauses after purity: 0
% 1.17/0.64 # Propositional unsat core size : 0
% 1.17/0.64 # Propositional preprocessing time : 0.000
% 1.17/0.64 # Propositional encoding time : 0.000
% 1.17/0.64 # Propositional solver time : 0.000
% 1.17/0.64 # Success case prop preproc time : 0.000
% 1.17/0.64 # Success case prop encoding time : 0.000
% 1.17/0.64 # Success case prop solver time : 0.000
% 1.17/0.64 # Current number of processed clauses : 497
% 1.17/0.64 # Positive orientable unit clauses : 216
% 1.17/0.64 # Positive unorientable unit clauses: 0
% 1.17/0.64 # Negative unit clauses : 2
% 1.17/0.64 # Non-unit-clauses : 279
% 1.17/0.64 # Current number of unprocessed clauses: 338
% 1.17/0.64 # ...number of literals in the above : 1044
% 1.17/0.64 # Current number of archived formulas : 0
% 1.17/0.64 # Current number of archived clauses : 736
% 1.17/0.64 # Clause-clause subsumption calls (NU) : 56988
% 1.17/0.64 # Rec. Clause-clause subsumption calls : 42936
% 1.17/0.64 # Non-unit clause-clause subsumptions : 188
% 1.17/0.64 # Unit Clause-clause subsumption calls : 4445
% 1.17/0.64 # Rewrite failures with RHS unbound : 0
% 1.17/0.64 # BW rewrite match attempts : 797
% 1.17/0.64 # BW rewrite match successes : 218
% 1.17/0.64 # Condensation attempts : 0
% 1.17/0.64 # Condensation successes : 0
% 1.17/0.64 # Termbank termtop insertions : 31286
% 1.17/0.64
% 1.17/0.64 # -------------------------------------------------
% 1.17/0.64 # User time : 0.104 s
% 1.17/0.64 # System time : 0.007 s
% 1.17/0.64 # Total time : 0.111 s
% 1.17/0.64 # Maximum resident set size: 2496 pages
% 1.17/0.64
% 1.17/0.64 # -------------------------------------------------
% 1.17/0.64 # User time : 0.111 s
% 1.17/0.64 # System time : 0.008 s
% 1.17/0.64 # Total time : 0.119 s
% 1.17/0.64 # Maximum resident set size: 2000 pages
% 1.17/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------