%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN117-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 : n003.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:11 PM UTC 2026
% Result : Unsatisfiable 1.33s 1.73s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 20 unt; 0 nHn; 36 RR)
% Number of literals : 66 ( 0 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 44 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_090,axiom,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_090) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(rule_154,axiom,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_154) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(rule_267,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_267) ).
cnf(rule_244,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_244) ).
cnf(rule_300,axiom,
( k5(X1)
| ~ s4(X2)
| ~ r3(X3,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_300) ).
cnf(prove_this,negated_conjecture,
~ k5(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_299,axiom,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_299) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(c_0_14,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_15,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_16,axiom,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
rule_090 ).
cnf(c_0_17,axiom,
r0(e),
axiom_13 ).
cnf(c_0_18,axiom,
k0(e),
axiom_28 ).
cnf(c_0_19,axiom,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
rule_154 ).
cnf(c_0_20,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).
cnf(c_0_21,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
rule_137 ).
cnf(c_0_22,plain,
p1(e,e,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_23,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
rule_267 ).
cnf(c_0_24,plain,
p2(e,e,e),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
rule_244 ).
cnf(c_0_26,plain,
n2(e),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
( k5(X1)
| ~ s4(X2)
| ~ r3(X3,X1,X1) ),
rule_300 ).
cnf(c_0_28,plain,
r3(e,e,e),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
~ k5(e),
prove_this ).
cnf(c_0_30,axiom,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
rule_299 ).
cnf(c_0_31,plain,
p3(e,e,e),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
rule_002 ).
cnf(c_0_33,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_34,plain,
~ s4(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_35,plain,
( s4(X1)
| ~ l1(X1,e) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
l1(e,e),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
~ l1(X1,e),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[c_0_36,c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN117-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.16/0.33 % Computer : n003.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 08:14:11 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.33/1.73 % Version : CSE_E---1.7
% 1.33/1.73 % Problem : theBenchmark.p
% 1.33/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.33/1.73 % SZS output start CNFRefutation
% See solution above
% 1.33/1.73 % Total time : 1.371s
%------------------------------------------------------------------------------