%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN202-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 : n005.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:26 PM UTC 2026
% Result : Unsatisfiable 1.43s 1.76s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 19 unt; 0 nHn; 28 RR)
% Number of literals : 75 ( 0 equ; 40 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 46 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_117) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(rule_187,axiom,
( q2(X1,X2,X1)
| ~ r1(X2)
| ~ m0(X3,X4,X1)
| ~ k0(X2)
| ~ q2(X2,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_187) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_181) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(prove_this,negated_conjecture,
~ s2(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(c_0_13,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_14,axiom,
s0(d),
axiom_1 ).
cnf(c_0_15,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_16,axiom,
k0(e),
axiom_28 ).
cnf(c_0_17,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14]),c_0_16])]) ).
cnf(c_0_19,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_20,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_21,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_22,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_23,axiom,
( q2(X1,X2,X1)
| ~ r1(X2)
| ~ m0(X3,X4,X1)
| ~ k0(X2)
| ~ q2(X2,X2,X2) ),
rule_187 ).
cnf(c_0_24,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
rule_181 ).
cnf(c_0_26,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
rule_189 ).
cnf(c_0_28,plain,
s1(b),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_29,plain,
( q2(X1,X2,X1)
| ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_30,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
~ s2(e),
prove_this ).
cnf(c_0_32,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_33,plain,
( q2(X1,X2,X1)
| ~ k0(X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_34,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_35,negated_conjecture,
~ q2(b,e,b),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( q2(X1,X2,X1)
| ~ k0(X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN202-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.34 % Computer : n005.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 08:20:30 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.43/1.76 % Version : CSE_E---1.7
% 1.43/1.76 % Problem : theBenchmark.p
% 1.43/1.76 % SZS status Unsatisfiable for theBenchmark.p
% 1.43/1.76 % SZS output start CNFRefutation
% See solution above
% 1.43/1.76 % Total time : 1.374s
%------------------------------------------------------------------------------