%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN033-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 : n026.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:20 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.66s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 5 RR)
% Number of literals : 15 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause3,axiom,
( p(X6,X5,X3)
| ~ p(X1,X2,X3)
| ~ p(X4,X5,X2)
| ~ p(X1,X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(prove_something,negated_conjecture,
~ p(k(X1),X1,k(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_something) ).
cnf(clause1,axiom,
p(g(X1,X2),X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause2,axiom,
p(X1,h(X1,X2),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(i_0_4,axiom,
( p(X6,X5,X3)
| ~ p(X1,X2,X3)
| ~ p(X4,X5,X2)
| ~ p(X1,X4,X6) ),
clause3,
[final] ).
cnf(i_0_5,negated_conjecture,
~ p(k(X1),X1,k(X1)),
prove_something,
[final] ).
cnf(i_0_6,axiom,
p(g(X1,X2),X1,X2),
clause1,
[final] ).
cnf(i_0_7,axiom,
p(X1,h(X1,X2),X2),
clause2,
[final] ).
cnf(i_0_8,plain,
$false,
inference(scs_inference,[],[i_0_5,i_0_6,i_0_7,i_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN033-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 : n026.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:05:23 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 0.25/1.66 % Version : CSE_E---1.7
% 0.25/1.66 % Problem : theBenchmark.p
% 0.25/1.66 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.66 % SZS output start CNFRefutation
% See solution above
% 0.25/1.67 % Total time : 1.308s
%------------------------------------------------------------------------------