%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN219-1 : TPTP v9.2.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n019.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:28 PM UTC 2026
% Result : Unsatisfiable 1.39s 1.75s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 17 unt; 0 nHn; 23 RR)
% Number of literals : 60 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 37 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_015,axiom,
( m1(X1,X2,X2)
| ~ l0(X3)
| ~ m0(X2,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_015) ).
cnf(axiom_31,axiom,
m0(b,b,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_31) ).
cnf(rule_131,axiom,
( l2(X1,X2)
| ~ s1(X1)
| ~ n0(e,X2)
| ~ l2(X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_131) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(axiom_11,axiom,
n0(e,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_11) ).
cnf(rule_134,axiom,
( l2(X1,X1)
| ~ m0(X2,X1,X3)
| ~ m1(X3,X2,X2)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_134) ).
cnf(prove_this,negated_conjecture,
~ l2(e,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_11,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_12,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_13,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_14,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_15,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
s1(b),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( m1(X1,X2,X2)
| ~ l0(X3)
| ~ m0(X2,X2,X1) ),
rule_015 ).
cnf(c_0_18,axiom,
m0(b,b,e),
axiom_31 ).
cnf(c_0_19,axiom,
( l2(X1,X2)
| ~ s1(X1)
| ~ n0(e,X2)
| ~ l2(X2,X2) ),
rule_131 ).
cnf(c_0_20,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( m1(e,b,b)
| ~ l0(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
l0(c),
axiom_24 ).
cnf(c_0_23,plain,
( l2(X1,X2)
| ~ l2(X2,X2)
| ~ n0(e,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_24,axiom,
n0(e,b),
axiom_11 ).
cnf(c_0_25,axiom,
( l2(X1,X1)
| ~ m0(X2,X1,X3)
| ~ m1(X3,X2,X2)
| ~ p0(X2,X1) ),
rule_134 ).
cnf(c_0_26,plain,
m1(e,b,b),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( l2(X1,b)
| ~ l2(b,b) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( l2(X1,X1)
| ~ m0(b,X1,e) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_14])]) ).
cnf(c_0_29,negated_conjecture,
~ l2(e,b),
prove_this ).
cnf(c_0_30,plain,
l2(X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN219-1 : TPTP v9.2.1. Released v1.1.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue May 5 08:21:44 EDT 2026
% 0.15/0.35 % CPUTime :
% 0.19/0.36 % start to proof: theBenchmark
% 1.39/1.75 % Version : CSE_E---1.7
% 1.39/1.75 % Problem : theBenchmark.p
% 1.39/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.39/1.75 % SZS output start CNFRefutation
% See solution above
% 1.39/1.76 % Total time : 1.374s
%------------------------------------------------------------------------------