%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN190-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 : n021.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:23 PM UTC 2026
% Result : Unsatisfiable 1.43s 1.75s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 23
% Syntax : Number of clauses : 70 ( 30 unt; 0 nHn; 58 RR)
% Number of literals : 140 ( 0 equ; 72 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 97 ( 37 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_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(rule_192,axiom,
( k3(X1,X2,X1)
| ~ s1(X2)
| ~ p2(X3,X2,X4)
| ~ n0(X1,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_192) ).
cnf(rule_159,axiom,
( p2(X1,X1,X1)
| ~ k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_159) ).
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(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_235,axiom,
( m3(X1,X1,X2)
| ~ r2(X2)
| ~ k3(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_235) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_188) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(rule_268,axiom,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_268) ).
cnf(rule_265,axiom,
( r3(X1,X1,X1)
| ~ l2(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_265) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(rule_135,axiom,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_135) ).
cnf(prove_this,negated_conjecture,
~ r3(a,X1,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_23,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_24,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_25,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_26,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_27,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
s1(b),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_30,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_31,axiom,
( k3(X1,X2,X1)
| ~ s1(X2)
| ~ p2(X3,X2,X4)
| ~ n0(X1,X4) ),
rule_192 ).
cnf(c_0_32,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,axiom,
( p2(X1,X1,X1)
| ~ k1(X1) ),
rule_159 ).
cnf(c_0_34,plain,
k1(a),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( k3(X1,X2,X1)
| ~ p2(X3,X2,X4)
| ~ n0(X1,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_36,plain,
p2(a,a,a),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_38,axiom,
s0(d),
axiom_1 ).
cnf(c_0_39,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_40,axiom,
k0(e),
axiom_28 ).
cnf(c_0_41,plain,
( k3(X1,a,X1)
| ~ n0(X1,a) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_43,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_38]),c_0_40])]) ).
cnf(c_0_44,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_45,axiom,
( m3(X1,X1,X2)
| ~ r2(X2)
| ~ k3(X1,X2,X1) ),
rule_235 ).
cnf(c_0_46,plain,
k3(b,a,b),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_47,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
rule_188 ).
cnf(c_0_48,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24])]) ).
cnf(c_0_49,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_32])]) ).
cnf(c_0_50,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_51,plain,
( m3(b,b,a)
| ~ r2(a) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_53,axiom,
l0(a),
axiom_20 ).
cnf(c_0_54,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,axiom,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
rule_268 ).
cnf(c_0_56,plain,
m3(b,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_57,axiom,
( r3(X1,X1,X1)
| ~ l2(X2,X1) ),
rule_265 ).
cnf(c_0_58,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_54,c_0_26]) ).
cnf(c_0_59,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
rule_002 ).
cnf(c_0_60,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_61,plain,
( r3(a,a,X1)
| ~ r3(X1,X2,X2)
| ~ m2(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
r3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,axiom,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
rule_135 ).
cnf(c_0_64,plain,
l1(d,d),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
( r3(a,a,X1)
| ~ m2(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
( m2(X1)
| ~ s0(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
~ r3(a,X1,d),
prove_this ).
cnf(c_0_68,plain,
( r3(a,a,X1)
| ~ s0(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN190-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 : n021.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:19:40 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.43/1.75 % Version : CSE_E---1.7
% 1.43/1.75 % Problem : theBenchmark.p
% 1.43/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.43/1.75 % SZS output start CNFRefutation
% See solution above
% 1.43/1.75 % Total time : 1.369s
%------------------------------------------------------------------------------