%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN060-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n002.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:57 PM UTC 2026
% Result : Unsatisfiable 1.24s 1.72s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 5 unt; 4 nHn; 7 RR)
% Number of literals : 17 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_7,negated_conjecture,
~ big_i(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_5,axiom,
( big_i(X1)
| big_f(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_1,axiom,
( ~ big_f(X1)
| ~ big_h(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_6,axiom,
( big_i(X1)
| big_h(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(c_0_4,negated_conjecture,
~ big_i(a),
clause_7 ).
cnf(c_0_5,axiom,
( big_i(X1)
| big_f(X1) ),
clause_5 ).
cnf(c_0_6,axiom,
( ~ big_f(X1)
| ~ big_h(X1) ),
clause_1 ).
cnf(c_0_7,negated_conjecture,
big_f(a),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,axiom,
( big_i(X1)
| big_h(X1) ),
clause_6 ).
cnf(c_0_9,negated_conjecture,
~ big_h(a),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN060-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n002.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 08:10:16 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.24/1.72 % Version : CSE_E---1.7
% 1.24/1.72 % Problem : theBenchmark.p
% 1.24/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.72 % SZS output start CNFRefutation
% See solution above
% 1.24/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------