%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET786-1 : TPTP v9.2.1. Released v2.5.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 : n025.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:08:29 PM UTC 2026
% Result : Unsatisfiable 0.24s 1.63s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 2 unt; 4 nHn; 5 RR)
% Number of literals : 18 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(thm25_1,negated_conjecture,
( ~ element(X1,X2)
| ~ element(X2,X1)
| ~ element(X2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm25_1) ).
cnf(thm25_3,negated_conjecture,
( element(X1,sk1)
| element(sk2(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm25_3) ).
cnf(thm25_2,negated_conjecture,
( element(X1,sk1)
| element(X1,sk2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm25_2) ).
cnf(i_0_3,negated_conjecture,
( ~ element(X1,X2)
| ~ element(X2,X1)
| ~ element(X2,sk1) ),
thm25_1,
[final] ).
cnf(i_0_4,negated_conjecture,
( element(X1,sk1)
| element(sk2(X1),X1) ),
thm25_3,
[final] ).
cnf(i_0_5,negated_conjecture,
( element(X1,sk1)
| element(X1,sk2(X1)) ),
thm25_2,
[final] ).
cnf(i_0_6,plain,
( ~ element(sk1,sk2(sk1))
| element(sk1,sk1) ),
inference(scs_inference,[],[i_0_4,i_0_3]) ).
cnf(i_0_7,plain,
element(sk1,sk1),
inference(scs_inference,[],[i_0_5,i_0_6]) ).
cnf(i_0_8,plain,
$false,
inference(scs_inference,[],[i_0_7,i_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET786-1 : TPTP v9.2.1. Released v2.5.0.
% 0.11/0.13 % 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 : n025.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 02:35:43 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 0.24/1.63 % Version : CSE_E---1.7
% 0.24/1.63 % Problem : theBenchmark.p
% 0.24/1.63 % SZS status Unsatisfiable for theBenchmark.p
% 0.24/1.63 % SZS output start CNFRefutation
% See solution above
% 0.24/1.64 % Total time : 1.271s
%------------------------------------------------------------------------------