%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN013-1 : TPTP v9.2.1. Released v1.0.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 : n017.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 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 47 ( 14 unt; 28 nHn; 43 RR)
% Number of literals : 126 ( 70 equ; 41 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_16,negated_conjecture,
( X1 = k
| X1 = m
| X1 = n
| ~ element(X1,k) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_16) ).
cnf(c_12,negated_conjecture,
( X1 = n
| element(X1,n)
| element(g(X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_12) ).
cnf(c_2,negated_conjecture,
n != k,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_2) ).
cnf(c_15,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != n ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_15) ).
cnf(c_10,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_10) ).
cnf(c_8,negated_conjecture,
( X1 = m
| element(X1,m)
| X2 = m
| X2 = X1
| ~ element(X1,X2)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_8) ).
cnf(c_1,negated_conjecture,
m != n,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_1) ).
cnf(c_3,negated_conjecture,
k != m,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_3) ).
cnf(c_11,negated_conjecture,
( X1 = n
| element(X1,n)
| element(X1,g(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_11) ).
cnf(c_9,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != n ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_9) ).
cnf(c_7,negated_conjecture,
( X1 = m
| element(f(X1),X1)
| ~ element(X1,m) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_7) ).
cnf(c_5,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_5) ).
cnf(c_6,negated_conjecture,
( X1 = m
| element(X1,f(X1))
| ~ element(X1,m) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_6) ).
cnf(c_4,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_4) ).
cnf(c_13,negated_conjecture,
( X1 = n
| X2 = n
| X2 = X1
| ~ element(X1,n)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_13) ).
cnf(c_14,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_14) ).
cnf(c_0_16,negated_conjecture,
( X1 = k
| X1 = m
| X1 = n
| ~ element(X1,k) ),
c_16 ).
cnf(c_0_17,negated_conjecture,
( X1 = n
| element(X1,n)
| element(g(X1),X1) ),
c_12 ).
cnf(c_0_18,negated_conjecture,
n != k,
c_2 ).
cnf(c_0_19,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != n ),
c_15 ).
cnf(c_0_20,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != X1 ),
c_10 ).
cnf(c_0_21,negated_conjecture,
( g(k) = k
| g(k) = n
| g(k) = m
| element(k,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( X1 = m
| element(X1,m)
| X2 = m
| X2 = X1
| ~ element(X1,X2)
| ~ element(X2,X1) ),
c_8 ).
cnf(c_0_23,negated_conjecture,
element(n,k),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
m != n,
c_1 ).
cnf(c_0_25,negated_conjecture,
k != m,
c_3 ).
cnf(c_0_26,negated_conjecture,
( X1 = n
| element(X1,n)
| element(X1,g(X1)) ),
c_11 ).
cnf(c_0_27,negated_conjecture,
( g(k) = m
| g(k) = n
| element(k,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( element(k,m)
| ~ element(k,n) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != n ),
c_9 ).
cnf(c_0_30,negated_conjecture,
( g(k) = n
| element(k,m) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( X1 = m
| element(f(X1),X1)
| ~ element(X1,m) ),
c_7 ).
cnf(c_0_32,negated_conjecture,
element(k,m),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
element(f(k),k),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != X1 ),
c_5 ).
cnf(c_0_35,negated_conjecture,
( f(k) = k
| f(k) = n
| f(k) = m ),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( X1 = m
| element(X1,f(X1))
| ~ element(X1,m) ),
c_6 ).
cnf(c_0_37,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != m ),
c_4 ).
cnf(c_0_38,negated_conjecture,
( f(k) = m
| f(k) = n ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32])]),c_0_25]) ).
cnf(c_0_39,negated_conjecture,
element(k,f(k)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_32]),c_0_25]) ).
cnf(c_0_40,negated_conjecture,
f(k) = n,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32])]),c_0_25]) ).
cnf(c_0_41,negated_conjecture,
( X1 = n
| X2 = n
| X2 = X1
| ~ element(X1,n)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
c_13 ).
cnf(c_0_42,negated_conjecture,
element(k,n),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != m ),
c_14 ).
cnf(c_0_44,negated_conjecture,
( k = X1
| X1 = n
| ~ element(X1,k)
| ~ element(k,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_18]) ).
cnf(c_0_45,negated_conjecture,
element(m,k),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_25]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_32])]),c_0_25]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN013-1 : TPTP v9.2.1. Released v1.0.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.33 % Computer : n017.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 08:02:57 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------