%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN195-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:24 PM UTC 2026
% Result : Unsatisfiable 1.33s 1.73s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of clauses : 42 ( 21 unt; 0 nHn; 40 RR)
% Number of literals : 72 ( 0 equ; 34 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 41 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
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_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(rule_067,axiom,
( p1(X1,X1,X1)
| ~ q0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_067) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(rule_327,axiom,
( r5(X1,X2)
| ~ s4(X1)
| ~ k0(b)
| ~ n3(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_327) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
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(prove_this,negated_conjecture,
~ r5(d,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_240,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_240) ).
cnf(rule_244,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_244) ).
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_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(c_0_15,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_16,axiom,
s0(d),
axiom_1 ).
cnf(c_0_17,axiom,
k0(e),
axiom_28 ).
cnf(c_0_18,axiom,
( p1(X1,X1,X1)
| ~ q0(X2,X1) ),
rule_067 ).
cnf(c_0_19,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_20,axiom,
( r5(X1,X2)
| ~ s4(X1)
| ~ k0(b)
| ~ n3(X2) ),
rule_327 ).
cnf(c_0_21,axiom,
k0(b),
axiom_32 ).
cnf(c_0_22,axiom,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
rule_154 ).
cnf(c_0_23,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_24,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
rule_137 ).
cnf(c_0_25,plain,
p1(d,d,d),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
~ r5(d,d),
prove_this ).
cnf(c_0_27,plain,
( r5(X1,X2)
| ~ s4(X1)
| ~ n3(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_28,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
rule_240 ).
cnf(c_0_29,plain,
p2(d,d,d),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
rule_244 ).
cnf(c_0_31,plain,
n2(d),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( ~ s4(d)
| ~ n3(d) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
n3(d),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,axiom,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
rule_299 ).
cnf(c_0_35,plain,
p3(d,d,d),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
rule_002 ).
cnf(c_0_37,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_38,negated_conjecture,
~ s4(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_39,plain,
( s4(X1)
| ~ l1(X1,d) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
l1(d,d),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN195-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.15/0.33 % Computer : n021.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:21:25 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.35 % 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.374s
%------------------------------------------------------------------------------