%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN273-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 : n008.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:38 PM UTC 2026
% Result : Unsatisfiable 1.40s 1.74s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 17 unt; 0 nHn; 29 RR)
% Number of literals : 58 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 38 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_127) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(prove_this,negated_conjecture,
~ p4(e,c,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_287,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_287) ).
cnf(rule_194,axiom,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_194) ).
cnf(c_0_12,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
rule_021 ).
cnf(c_0_13,axiom,
k0(e),
axiom_28 ).
cnf(c_0_14,plain,
( m1(X1,e,X1)
| ~ l0(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
l0(c),
axiom_24 ).
cnf(c_0_16,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_17,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_18,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
rule_127 ).
cnf(c_0_19,plain,
m1(c,e,c),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
rule_129 ).
cnf(c_0_21,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17])]) ).
cnf(c_0_22,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_23,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_24,plain,
( k2(c,e)
| ~ k2(X1,e)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
k1(e),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
~ p4(e,c,e),
prove_this ).
cnf(c_0_28,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
rule_287 ).
cnf(c_0_29,axiom,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
rule_194 ).
cnf(c_0_30,plain,
k2(c,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
~ k3(e,e,c),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN273-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 : n008.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.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 08:24:28 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.40/1.74 % Version : CSE_E---1.7
% 1.40/1.74 % Problem : theBenchmark.p
% 1.40/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.40/1.74 % SZS output start CNFRefutation
% See solution above
% 1.40/1.74 % Total time : 1.374s
%------------------------------------------------------------------------------