%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN249-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 : n022.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.39s 1.74s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 15 RR)
% Number of literals : 28 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 13 ( 4 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(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(prove_this,negated_conjecture,
~ m1(d,e,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_6,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_7,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_8,axiom,
( m1(X1,X2,X2)
| ~ k1(a)
| ~ k1(X2)
| ~ q0(X1,X1) ),
rule_034 ).
cnf(c_0_9,plain,
k1(a),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( m1(X1,X2,X2)
| ~ k1(X2)
| ~ q0(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_11,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_12,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_13,plain,
( m1(d,X1,X1)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
k1(e),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ m1(d,e,e),
prove_this ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN249-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.14/0.33 % Computer : n022.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue May 5 08:23:51 EDT 2026
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % start to proof: theBenchmark
% 1.39/1.74 % Version : CSE_E---1.7
% 1.39/1.74 % Problem : theBenchmark.p
% 1.39/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.39/1.74 % SZS output start CNFRefutation
% See solution above
% 1.39/1.74 % Total time : 1.370s
%------------------------------------------------------------------------------