%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN062-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 : n007.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:58 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 9 unt; 0 nHn; 19 RR)
% Number of literals : 36 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_3,axiom,
( big_j(X1)
| ~ big_i(X1)
| ~ big_h(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_2,axiom,
( big_i(X1)
| ~ big_f(X1)
| ~ big_h(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,axiom,
( big_i(X1)
| ~ big_f(X1)
| ~ big_g(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_4,axiom,
( big_h(X1)
| ~ big_k(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_7,negated_conjecture,
~ big_j(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_6,negated_conjecture,
big_k(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_5,negated_conjecture,
big_f(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(i_0_7,axiom,
( big_j(X1)
| ~ big_i(X1)
| ~ big_h(X1) ),
clause_3,
[final] ).
cnf(i_0_8,axiom,
( big_i(X1)
| ~ big_f(X1)
| ~ big_h(X1) ),
clause_2,
[final] ).
cnf(i_0_9,axiom,
( big_i(X1)
| ~ big_f(X1)
| ~ big_g(X1) ),
clause_1,
[final] ).
cnf(i_0_10,axiom,
( big_h(X1)
| ~ big_k(X1) ),
clause_4,
[final] ).
cnf(i_0_11,negated_conjecture,
~ big_j(a),
clause_7,
[final] ).
cnf(i_0_12,negated_conjecture,
big_k(a),
clause_6,
[final] ).
cnf(i_0_13,negated_conjecture,
big_f(a),
clause_5,
[final] ).
cnf(i_0_14,plain,
big_h(a),
inference(scs_inference,[],[i_0_12,i_0_10]) ).
cnf(i_0_15,plain,
( ~ big_k(X1)
| big_h(X1) ),
inference(rename_variables,[],[i_0_10]) ).
cnf(i_0_16,plain,
big_i(a),
inference(scs_inference,[],[i_0_12,i_0_13,i_0_10,i_0_8]) ).
cnf(i_0_17,plain,
( ~ big_f(X1)
| ~ big_h(X1)
| big_i(X1) ),
inference(rename_variables,[],[i_0_8]) ).
cnf(i_0_18,plain,
$false,
inference(scs_inference,[],[i_0_11,i_0_12,i_0_13,i_0_10,i_0_8,i_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN062-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 : n007.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.34 % DateTime : Tue May 5 08:09:09 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 0.25/1.62 % Version : CSE_E---1.7
% 0.25/1.62 % Problem : theBenchmark.p
% 0.25/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.64 % Total time : 1.271s
%------------------------------------------------------------------------------