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