%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN250-1 : TPTP v9.2.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n028.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:34 PM UTC 2026
% Result : Unsatisfiable 1.43s 1.75s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 19 unt; 0 nHn; 29 RR)
% Number of literals : 65 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 42 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(rule_034,axiom,
( m1(X1,X2,X2)
| ~ k1(a)
| ~ k1(X2)
| ~ q0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_034) ).
cnf(rule_007,axiom,
( m1(X1,X2,X1)
| ~ p0(X3,X2)
| ~ r0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_007) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_6,axiom,
q0(b,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_6) ).
cnf(rule_024,axiom,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_024) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(rule_016,axiom,
( m1(X1,X2,X2)
| ~ m1(X3,X2,X1)
| ~ m1(X3,X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_016) ).
cnf(axiom_21,axiom,
q0(b,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_21) ).
cnf(prove_this,negated_conjecture,
~ m1(e,a,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_12,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_13,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_14,axiom,
( m1(X1,X2,X2)
| ~ k1(a)
| ~ k1(X2)
| ~ q0(X1,X1) ),
rule_034 ).
cnf(c_0_15,plain,
k1(a),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
( m1(X1,X2,X1)
| ~ p0(X3,X2)
| ~ r0(X1) ),
rule_007 ).
cnf(c_0_17,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_18,plain,
( m1(X1,X2,X2)
| ~ k1(X2)
| ~ q0(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_19,axiom,
q0(b,b),
axiom_6 ).
cnf(c_0_20,axiom,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
rule_024 ).
cnf(c_0_21,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_22,plain,
( m1(X1,X2,X1)
| ~ r0(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,axiom,
r0(e),
axiom_13 ).
cnf(c_0_24,plain,
( m1(b,X1,X1)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( m1(X1,a,X2)
| ~ m1(X2,c,X2)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_26,plain,
m1(e,X1,e),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
( m1(X1,X2,X2)
| ~ m1(X3,X2,X1)
| ~ m1(X3,X4,X2) ),
rule_016 ).
cnf(c_0_28,plain,
m1(b,a,a),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_29,plain,
( m1(X1,a,e)
| ~ q0(X1,e) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,axiom,
q0(b,e),
axiom_21 ).
cnf(c_0_31,plain,
( m1(X1,a,a)
| ~ m1(b,a,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
m1(b,a,e),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ m1(e,a,a),
prove_this ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN250-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.34 % Computer : n028.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue May 5 08:24:15 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % 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.375s
%------------------------------------------------------------------------------