%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN137-1 : TPTP v9.2.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n015.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:36:14 PM UTC 2026
% Result : Unsatisfiable 1.41s 1.74s
% Output : CNFRefutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 50 ( 24 unt; 0 nHn; 37 RR)
% Number of literals : 98 ( 0 equ; 52 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 59 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).
cnf(rule_131,axiom,
( l2(X1,X2)
| ~ s1(X1)
| ~ n0(e,X2)
| ~ l2(X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_131) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(axiom_11,axiom,
n0(e,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_11) ).
cnf(rule_237,axiom,
( m3(X1,c,X1)
| ~ s2(c)
| ~ q2(X1,c,c) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_237) ).
cnf(rule_183,axiom,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_183) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(prove_this,negated_conjecture,
~ m3(b,c,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(c_0_16,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_17,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_18,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_19,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_20,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
s1(b),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_23,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
( l2(X1,X2)
| ~ s1(X1)
| ~ n0(e,X2)
| ~ l2(X2,X2) ),
rule_131 ).
cnf(c_0_25,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_27,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
rule_189 ).
cnf(c_0_28,plain,
( l2(X1,X2)
| ~ l2(X2,X2)
| ~ n0(e,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23])]) ).
cnf(c_0_29,axiom,
n0(e,b),
axiom_11 ).
cnf(c_0_30,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,axiom,
( m3(X1,c,X1)
| ~ s2(c)
| ~ q2(X1,c,c) ),
rule_237 ).
cnf(c_0_32,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_21])]) ).
cnf(c_0_33,axiom,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
rule_183 ).
cnf(c_0_34,axiom,
l0(c),
axiom_24 ).
cnf(c_0_35,plain,
( l2(X1,b)
| ~ l2(b,b) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_37,negated_conjecture,
~ m3(b,c,b),
prove_this ).
cnf(c_0_38,plain,
( m3(X1,c,X1)
| ~ q2(b,c,b)
| ~ q2(X1,c,c) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
( q2(X1,c,X2)
| ~ l2(X2,X1)
| ~ k1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_40,plain,
l2(X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_41,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_42,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_43,negated_conjecture,
( ~ q2(b,c,b)
| ~ q2(b,c,c) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( q2(b,c,X1)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
k1(c),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_47,negated_conjecture,
~ q2(b,c,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_48,plain,
k1(b),
inference(spm,[status(thm)],[c_0_41,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN137-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n015.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 08:16:01 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.41/1.74 % Version : CSE_E---1.7
% 1.41/1.74 % Problem : theBenchmark.p
% 1.41/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.41/1.74 % SZS output start CNFRefutation
% See solution above
% 1.41/1.74 % Total time : 1.372s
%------------------------------------------------------------------------------