%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN109-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:10 PM UTC 2026
% Result : Unsatisfiable 1.39s 1.74s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 24 unt; 0 nHn; 32 RR)
% Number of literals : 66 ( 0 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 39 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_035,axiom,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_035) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_029,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_029) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_127) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(axiom_3,axiom,
n0(d,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_3) ).
cnf(prove_this,negated_conjecture,
~ k2(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_14,axiom,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
rule_035 ).
cnf(c_0_15,axiom,
l0(c),
axiom_24 ).
cnf(c_0_16,plain,
( m1(X1,c,X1)
| ~ r0(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
r0(e),
axiom_13 ).
cnf(c_0_18,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_19,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_20,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
rule_029 ).
cnf(c_0_21,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_22,axiom,
s0(b),
axiom_5 ).
cnf(c_0_23,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
rule_127 ).
cnf(c_0_24,plain,
m1(e,c,e),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
rule_129 ).
cnf(c_0_26,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19])]) ).
cnf(c_0_27,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_28,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_29,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_30,plain,
( k2(e,c)
| ~ k2(X1,c)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
k1(c),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,axiom,
n0(d,e),
axiom_3 ).
cnf(c_0_34,plain,
( k2(b,X1)
| ~ k2(X2,X1)
| ~ k1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_35,plain,
k2(e,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
k1(e),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ k2(b,c),
prove_this ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN109-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.12 % 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.33 % Computer : n019.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 08:14:14 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.39/1.74 % Version : CSE_E---1.7
% 1.39/1.74 % Problem : theBenchmark.p
% 1.39/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.39/1.74 % SZS output start CNFRefutation
% See solution above
% 1.39/1.74 % Total time : 1.369s
%------------------------------------------------------------------------------