%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN331-1 : TPTP v9.2.1. Released v1.2.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 : n009.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:49 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 5 unt; 3 nHn; 5 RR)
% Number of literals : 15 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 17 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause3,negated_conjecture,
( f(X1,X2)
| ~ f(z(X1,X2),z(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause5,negated_conjecture,
( f(X1,X2)
| f(z(X2,X1),z(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause7,negated_conjecture,
~ f(z(X1,X2),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
cnf(c_0_3,negated_conjecture,
( f(X1,X2)
| ~ f(z(X1,X2),z(X1,X2)) ),
clause3 ).
cnf(c_0_4,negated_conjecture,
( f(X1,X2)
| f(z(X2,X1),z(X2,X1)) ),
clause5 ).
cnf(c_0_5,negated_conjecture,
( f(X1,X2)
| f(X2,X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,negated_conjecture,
f(X1,X1),
inference(ef,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
~ f(z(X1,X2),X2),
clause7 ).
cnf(c_0_8,negated_conjecture,
f(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_6])]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN331-1 : TPTP v9.2.1. Released v1.2.0.
% 0.00/0.11 % 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.14/0.32 % Computer : n009.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 08:27:56 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------