%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN193-10 : TPTP v9.2.1. Released v7.3.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 : n011.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.44s 1.78s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 10 RR)
% Number of literals : 34 ( 33 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-4 aty)
% Number of variables : 55 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_029,axiom,
ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_029) ).
cnf(axiom_5,axiom,
s0(b) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
cnf(axiom_14,axiom,
p0(b,X1) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_176,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_176) ).
cnf(rule_240,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_240) ).
cnf(rule_002,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_002) ).
cnf(axiom_30,axiom,
n0(e,e) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_30) ).
cnf(rule_298,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_298) ).
cnf(rule_186,axiom,
ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_186) ).
cnf(rule_255,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_255) ).
cnf(prove_this,negated_conjecture,
r4(b) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_12,axiom,
ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
rule_029 ).
cnf(c_0_13,axiom,
s0(b) = true,
axiom_5 ).
cnf(c_0_14,axiom,
p0(b,X1) = true,
axiom_14 ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_16,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
rule_176 ).
cnf(c_0_17,plain,
m1(b,X1,b) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_15]) ).
cnf(c_0_18,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
rule_240 ).
cnf(c_0_19,plain,
p2(X1,b,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_20,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
rule_002 ).
cnf(c_0_21,axiom,
n0(e,e) = true,
axiom_30 ).
cnf(c_0_22,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
rule_298 ).
cnf(c_0_23,plain,
n3(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).
cnf(c_0_24,axiom,
ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
rule_186 ).
cnf(c_0_25,plain,
l1(e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_26,plain,
ifeq(q3(X1,X2),true,ifeq(p0(X3,X4),true,r4(X4),true),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_15]) ).
cnf(c_0_27,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
rule_255 ).
cnf(c_0_28,plain,
q2(e,e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]) ).
cnf(c_0_29,plain,
ifeq(q3(X1,X2),true,r4(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_15]) ).
cnf(c_0_30,plain,
q3(e,e) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]),c_0_15]),c_0_15]) ).
cnf(c_0_31,negated_conjecture,
r4(b) != true,
prove_this ).
cnf(c_0_32,plain,
r4(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN193-10 : TPTP v9.2.1. Released v7.3.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 : n011.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:19:02 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.44/1.78 % Version : CSE_E---1.7
% 1.44/1.78 % Problem : theBenchmark.p
% 1.44/1.78 % SZS status Unsatisfiable for theBenchmark.p
% 1.44/1.78 % SZS output start CNFRefutation
% See solution above
% 1.44/1.78 % Total time : 1.375s
%------------------------------------------------------------------------------