%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN406+1 : TPTP v9.2.1. Released v2.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 : n019.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:37:02 PM UTC 2026
% Result : Theorem 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 28 ( 10 ~; 5 |; 9 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 11 ( 0 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish240,conjecture,
( ( ! [X1] :
( f(X1)
=> g(X1) )
& ? [X2] :
( f(X2)
& h(X2) ) )
=> ? [X3] :
( g(X3)
& h(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish240) ).
fof(i_0_1,negated_conjecture,
~ ( ( ! [X1] :
( f(X1)
=> g(X1) )
& ? [X2] :
( f(X2)
& h(X2) ) )
=> ? [X3] :
( g(X3)
& h(X3) ) ),
inference(assume_negation,[status(cth)],[kalish240]) ).
fof(i_0_2,negated_conjecture,
! [X7,X9] :
( ( ~ f(X7)
| g(X7) )
& f(esk1_0)
& h(esk1_0)
& ( ~ g(X9)
| ~ h(X9) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])]) ).
cnf(i_0_3,negated_conjecture,
( ~ g(X1)
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
( g(X1)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,negated_conjecture,
h(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_6,negated_conjecture,
f(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,plain,
~ g(esk1_0),
inference(scs_inference,[],[i_0_5,i_0_3]) ).
cnf(i_0_8,plain,
( ~ h(X1)
| ~ g(X1) ),
inference(rename_variables,[],[i_0_3]) ).
cnf(i_0_9,plain,
$false,
inference(scs_inference,[],[i_0_5,i_0_6,i_0_3,i_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN406+1 : TPTP v9.2.1. Released v2.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.15/0.33 % Computer : n019.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 08:31:29 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % 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 Theorem for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.63 % Total time : 1.271s
%------------------------------------------------------------------------------