%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN354-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 : n024.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:54 PM UTC 2026
% Result : Unsatisfiable 1.10s 1.60s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 5 unt; 3 nHn; 13 RR)
% Number of literals : 31 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause3,negated_conjecture,
( g(b,z(X1,X2))
| g(X2,z(X1,X2))
| f(b,X2)
| ~ f(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause1,negated_conjecture,
f(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause7,negated_conjecture,
( ~ f(a,X1)
| ~ f(b,X1)
| ~ f(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
cnf(clause4,negated_conjecture,
( f(b,X2)
| ~ g(b,z(X1,X2))
| ~ g(X2,z(X1,X2))
| ~ f(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(c_0_4,negated_conjecture,
( g(b,z(X1,X2))
| g(X2,z(X1,X2))
| f(b,X2)
| ~ f(X1,X2) ),
clause3 ).
cnf(c_0_5,negated_conjecture,
f(a,b),
clause1 ).
cnf(c_0_6,negated_conjecture,
( ~ f(a,X1)
| ~ f(b,X1)
| ~ f(X1,X2) ),
clause7 ).
cnf(c_0_7,negated_conjecture,
( f(b,X2)
| ~ g(b,z(X1,X2))
| ~ g(X2,z(X1,X2))
| ~ f(X1,X2) ),
clause4 ).
cnf(c_0_8,negated_conjecture,
( g(b,z(a,b))
| f(b,b) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ f(b,b)
| ~ f(b,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
f(b,b),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_5])]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ f(b,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SYN354-1 : TPTP v9.2.1. Released v1.2.0.
% 0.00/0.06 % 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.05/0.24 % Computer : n024.cluster.edu
% 0.05/0.24 % Model : x86_64 x86_64
% 0.05/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.24 % Memory : 8042.1875MB
% 0.05/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.05/0.24 % CPULimit : 300
% 0.05/0.24 % WCLimit : 300
% 0.05/0.24 % DateTime : Tue May 5 03:29:41 EDT 2026
% 0.05/0.24 % CPUTime :
% 0.05/0.24 % start to proof: theBenchmark
% 1.10/1.60 % Version : CSE_E---1.7
% 1.10/1.60 % Problem : theBenchmark.p
% 1.10/1.60 % SZS status Unsatisfiable for theBenchmark.p
% 1.10/1.60 % SZS output start CNFRefutation
% See solution above
% 1.10/1.60 % Total time : 1.361s
%------------------------------------------------------------------------------