%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN014-2 : TPTP v9.2.1. Released v1.0.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 : 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:35:19 PM UTC 2026
% Result : Unsatisfiable 0.27s 1.61s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 26
% Syntax : Number of clauses : 59 ( 18 unt; 27 nHn; 53 RR)
% Number of literals : 152 ( 0 equ; 62 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 64 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_14,negated_conjecture,
( equalish(X1,X2)
| equalish(X1,n)
| equalish(X2,n)
| ~ element(X1,X2)
| ~ element(X2,X1)
| ~ element(X2,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_14) ).
cnf(c_9,negated_conjecture,
( equalish(X1,X2)
| equalish(X1,m)
| element(X2,m)
| equalish(X2,m)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_9) ).
cnf(c_6,negated_conjecture,
( equalish(X1,m)
| ~ equalish(f(X1),X1)
| ~ element(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_6) ).
cnf(c_5,negated_conjecture,
( equalish(X1,m)
| ~ equalish(f(X1),m)
| ~ element(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_5) ).
cnf(element_substitutionish1,axiom,
( element(X3,X2)
| ~ equalish(X1,X2)
| ~ element(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_substitutionish1) ).
cnf(element_substitutionish2,axiom,
( element(X3,X2)
| ~ element(X1,X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_substitutionish2) ).
cnf(transitivityish,axiom,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivityish) ).
cnf(c_17,negated_conjecture,
( equalish(X1,n)
| equalish(X1,m)
| equalish(X1,k)
| ~ element(X1,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_17) ).
cnf(c_11,negated_conjecture,
( element(X1,n)
| equalish(X1,n)
| ~ equalish(g(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).
cnf(c_10,negated_conjecture,
( element(X1,n)
| equalish(X1,n)
| ~ equalish(g(X1),n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).
cnf(c_8,negated_conjecture,
( element(f(X1),X1)
| equalish(X1,m)
| ~ element(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_8) ).
cnf(c_7,negated_conjecture,
( element(X1,f(X1))
| equalish(X1,m)
| ~ element(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_7) ).
cnf(c_13,negated_conjecture,
( element(g(X1),X1)
| element(X1,n)
| equalish(X1,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).
cnf(c_12,negated_conjecture,
( element(X1,g(X1))
| element(X1,n)
| equalish(X1,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_12) ).
cnf(c_16,negated_conjecture,
( element(X1,k)
| equalish(X1,k)
| ~ equalish(X1,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
cnf(c_15,negated_conjecture,
( element(X1,k)
| equalish(X1,k)
| ~ equalish(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).
cnf(c_4,negated_conjecture,
( element(X1,a)
| equalish(X1,a)
| ~ equalish(X1,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_4) ).
cnf(c_3,negated_conjecture,
( equalish(X1,k)
| equalish(X1,a)
| ~ element(X1,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_3) ).
cnf(symmetryish,axiom,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetryish) ).
cnf(c_18,negated_conjecture,
~ equalish(n,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_18) ).
cnf(c_19,negated_conjecture,
~ equalish(m,n),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_19) ).
cnf(c_21,negated_conjecture,
~ equalish(m,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_21) ).
cnf(c_22,negated_conjecture,
~ equalish(k,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_22) ).
cnf(reflexivityish,axiom,
equalish(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivityish) ).
cnf(c_20,negated_conjecture,
equalish(n,k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_20) ).
cnf(c_23,negated_conjecture,
equalish(m,k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_23) ).
cnf(i_0_26,negated_conjecture,
( equalish(X1,X2)
| equalish(X1,n)
| equalish(X2,n)
| ~ element(X1,X2)
| ~ element(X2,X1)
| ~ element(X2,n) ),
c_14,
[final] ).
cnf(i_0_27,negated_conjecture,
( equalish(X1,X2)
| equalish(X1,m)
| element(X2,m)
| equalish(X2,m)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
c_9,
[final] ).
cnf(i_0_28,negated_conjecture,
( equalish(X1,m)
| ~ equalish(f(X1),X1)
| ~ element(X1,m) ),
c_6,
[final] ).
cnf(i_0_29,negated_conjecture,
( equalish(X1,m)
| ~ equalish(f(X1),m)
| ~ element(X1,m) ),
c_5,
[final] ).
cnf(i_0_30,axiom,
( element(X3,X2)
| ~ equalish(X1,X2)
| ~ element(X3,X1) ),
element_substitutionish1,
[final] ).
cnf(i_0_31,axiom,
( element(X3,X2)
| ~ element(X1,X2)
| ~ equalish(X1,X3) ),
element_substitutionish2,
[final] ).
cnf(i_0_32,axiom,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
transitivityish,
[final] ).
cnf(i_0_33,negated_conjecture,
( equalish(X1,n)
| equalish(X1,m)
| equalish(X1,k)
| ~ element(X1,k) ),
c_17,
[final] ).
cnf(i_0_34,negated_conjecture,
( element(X1,n)
| equalish(X1,n)
| ~ equalish(g(X1),X1) ),
c_11,
[final] ).
cnf(i_0_35,negated_conjecture,
( element(X1,n)
| equalish(X1,n)
| ~ equalish(g(X1),n) ),
c_10,
[final] ).
cnf(i_0_36,negated_conjecture,
( element(f(X1),X1)
| equalish(X1,m)
| ~ element(X1,m) ),
c_8,
[final] ).
cnf(i_0_37,negated_conjecture,
( element(X1,f(X1))
| equalish(X1,m)
| ~ element(X1,m) ),
c_7,
[final] ).
cnf(i_0_38,negated_conjecture,
( element(g(X1),X1)
| element(X1,n)
| equalish(X1,n) ),
c_13,
[final] ).
cnf(i_0_39,negated_conjecture,
( element(X1,g(X1))
| element(X1,n)
| equalish(X1,n) ),
c_12,
[final] ).
cnf(i_0_40,negated_conjecture,
( element(X1,k)
| equalish(X1,k)
| ~ equalish(X1,n) ),
c_16,
[final] ).
cnf(i_0_41,negated_conjecture,
( element(X1,k)
| equalish(X1,k)
| ~ equalish(X1,m) ),
c_15,
[final] ).
cnf(i_0_42,negated_conjecture,
( element(X1,a)
| equalish(X1,a)
| ~ equalish(X1,k) ),
c_4,
[final] ).
cnf(i_0_43,negated_conjecture,
( equalish(X1,k)
| equalish(X1,a)
| ~ element(X1,a) ),
c_3,
[final] ).
cnf(i_0_44,axiom,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
symmetryish,
[final] ).
cnf(i_0_45,negated_conjecture,
~ equalish(n,a),
c_18,
[final] ).
cnf(i_0_46,negated_conjecture,
~ equalish(m,n),
c_19,
[final] ).
cnf(i_0_47,negated_conjecture,
~ equalish(m,a),
c_21,
[final] ).
cnf(i_0_48,negated_conjecture,
~ equalish(k,a),
c_22,
[final] ).
cnf(i_0_49,axiom,
equalish(X1,X1),
reflexivityish,
[final] ).
cnf(i_0_50,negated_conjecture,
equalish(n,k),
c_20,
[final] ).
cnf(i_0_51,negated_conjecture,
equalish(m,k),
c_23,
[final] ).
cnf(i_0_52,plain,
equalish(k,n),
inference(scs_inference,[],[i_0_50,i_0_44]) ).
cnf(i_0_53,plain,
( ~ equalish(X1,X2)
| equalish(X2,X1) ),
inference(rename_variables,[],[i_0_44]) ).
cnf(i_0_54,plain,
element(n,a),
inference(scs_inference,[],[i_0_45,i_0_50,i_0_44,i_0_42]) ).
cnf(i_0_55,plain,
( equalish(X1,a)
| ~ equalish(X1,k)
| element(X1,a) ),
inference(rename_variables,[],[i_0_42]) ).
cnf(i_0_56,plain,
element(k,a),
inference(scs_inference,[],[i_0_45,i_0_50,i_0_44,i_0_42,i_0_31]) ).
cnf(i_0_57,plain,
( ~ equalish(X1,X2)
| element(X2,X3)
| ~ element(X1,X3) ),
inference(rename_variables,[],[i_0_31]) ).
cnf(i_0_58,plain,
$false,
inference(scs_inference,[],[i_0_45,i_0_46,i_0_50,i_0_51,i_0_44,i_0_42,i_0_31,i_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN014-2 : TPTP v9.2.1. Released v1.0.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.13/0.32 % Computer : n021.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 08:04:55 EDT 2026
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % start to proof: theBenchmark
% 0.27/1.61 % Version : CSE_E---1.7
% 0.27/1.61 % Problem : theBenchmark.p
% 0.27/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.27/1.61 % SZS output start CNFRefutation
% See solution above
% 0.27/1.64 % Total time : 1.271s
%------------------------------------------------------------------------------