%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN319+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 : n027.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 : Theorem 0.27s 1.62s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 82 ( 30 ~; 26 |; 12 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 21 ( 7 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_2_5,conjecture,
? [X1,X2] :
! [X3,X4] :
( ( ( big_f(X2)
=> big_g(X3) )
=> ( big_g(X1)
& ~ big_f(X3) ) )
=> ( ( ( big_f(X1)
| big_g(X1) )
=> big_h(X1) )
=> ( big_h(X4)
& ( big_h(X2)
=> ( ( big_f(X4)
| big_g(X4) )
=> big_h(X4) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_5) ).
fof(i_0_1,negated_conjecture,
~ ? [X1,X2] :
! [X3,X4] :
( ( ( big_f(X2)
=> big_g(X3) )
=> ( big_g(X1)
& ~ big_f(X3) ) )
=> ( ( ( big_f(X1)
| big_g(X1) )
=> big_h(X1) )
=> ( big_h(X4)
& ( big_h(X2)
=> ( ( big_f(X4)
| big_g(X4) )
=> big_h(X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[church_46_2_5])]) ).
fof(i_0_2,negated_conjecture,
! [X9,X11,X13,X15] :
( ( big_g(X11)
| big_f(X9) )
& ( ~ big_f(esk2_0)
| big_f(X9) )
& ( big_g(X11)
| ~ big_g(esk1_0) )
& ( ~ big_f(esk2_0)
| ~ big_g(esk1_0) )
& ( ~ big_f(X13)
| big_h(X13) )
& ( ~ big_g(X13)
| big_h(X13) )
& ( big_h(X15)
| ~ big_h(esk3_0) )
& ( big_f(esk4_0)
| big_g(esk4_0)
| ~ big_h(esk3_0) )
& ( ~ big_h(esk4_0)
| ~ big_h(esk3_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])])])]) ).
cnf(i_0_3,negated_conjecture,
( big_h(X1)
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
( big_h(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,negated_conjecture,
( big_f(esk4_0)
| big_g(esk4_0)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_6,negated_conjecture,
( ~ big_h(esk4_0)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,negated_conjecture,
( ~ big_f(esk2_0)
| ~ big_g(esk1_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_8,negated_conjecture,
( big_h(X1)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_9,negated_conjecture,
( big_g(X1)
| ~ big_g(esk1_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_10,negated_conjecture,
( big_f(X1)
| ~ big_f(esk2_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_11,negated_conjecture,
( big_g(X1)
| big_f(X2) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_12,plain,
( big_h(X1)
| ~ big_g(esk1_0) ),
inference(scs_inference,[],[i_0_3,i_0_9]) ).
cnf(i_0_13,plain,
( big_h(X1)
| ~ big_f(esk2_0) ),
inference(scs_inference,[],[i_0_4,i_0_10]) ).
cnf(i_0_14,plain,
~ big_h(esk3_0),
inference(scs_inference,[],[i_0_6,i_0_8]) ).
cnf(i_0_15,plain,
~ big_g(esk1_0),
inference(scs_inference,[],[i_0_14,i_0_12]) ).
cnf(i_0_16,plain,
~ big_f(esk2_0),
inference(scs_inference,[],[i_0_14,i_0_13]) ).
cnf(i_0_17,plain,
~ big_g(esk1_0),
inference(scs_inference,[],[i_0_15,i_0_9]) ).
cnf(i_0_18,plain,
~ big_f(esk2_0),
inference(scs_inference,[],[i_0_16,i_0_10]) ).
cnf(i_0_19,plain,
$false,
inference(scs_inference,[],[i_0_15,i_0_16,i_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN319+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.17/0.33 % Computer : n027.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Tue May 5 08:28:04 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.35 % start to proof: theBenchmark
% 0.27/1.62 % Version : CSE_E---1.7
% 0.27/1.62 % Problem : theBenchmark.p
% 0.27/1.62 % SZS status Theorem for theBenchmark.p
% 0.27/1.62 % SZS output start CNFRefutation
% See solution above
% 0.27/1.65 % Total time : 1.274s
%------------------------------------------------------------------------------