%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN352+1 : TPTP v9.2.1. Released v2.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 : n005.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:54 PM UTC 2026
% Result : Theorem 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 2 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 55 ( 12 ~; 19 |; 8 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_18_4,conjecture,
! [X1,X2] :
? [X3,X4] :
! [X5] :
( big_f(X1,X2)
=> ( ( big_f(X3,X4)
=> ( big_f(X2,X5)
| big_f(X4,X5) ) )
=> ( ( ( big_f(X3,X4)
=> ( big_f(X2,X5)
<=> big_f(X3,X5) ) )
=> big_f(X5,X5) )
=> ( big_f(X3,X4)
& ( big_f(X3,X5)
<=> big_f(X4,X5) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_18_4) ).
fof(c_0_1,negated_conjecture,
~ ! [X1,X2] :
? [X3,X4] :
! [X5] :
( big_f(X1,X2)
=> ( ( big_f(X3,X4)
=> ( big_f(X2,X5)
| big_f(X4,X5) ) )
=> ( ( ( big_f(X3,X4)
=> ( big_f(X2,X5)
<=> big_f(X3,X5) ) )
=> big_f(X5,X5) )
=> ( big_f(X3,X4)
& ( big_f(X3,X5)
<=> big_f(X4,X5) ) ) ) ) ),
inference(assume_negation,[status(cth)],[church_46_18_4]) ).
fof(c_0_2,negated_conjecture,
! [X13,X14] :
( big_f(esk1_0,esk2_0)
& ( ~ big_f(X13,X14)
| big_f(esk2_0,esk3_2(X13,X14))
| big_f(X14,esk3_2(X13,X14)) )
& ( big_f(X13,X14)
| big_f(esk3_2(X13,X14),esk3_2(X13,X14)) )
& ( ~ big_f(esk2_0,esk3_2(X13,X14))
| ~ big_f(X13,esk3_2(X13,X14))
| big_f(esk3_2(X13,X14),esk3_2(X13,X14)) )
& ( big_f(esk2_0,esk3_2(X13,X14))
| big_f(X13,esk3_2(X13,X14))
| big_f(esk3_2(X13,X14),esk3_2(X13,X14)) )
& ( ~ big_f(X13,esk3_2(X13,X14))
| ~ big_f(X14,esk3_2(X13,X14))
| ~ big_f(X13,X14) )
& ( big_f(X13,esk3_2(X13,X14))
| big_f(X14,esk3_2(X13,X14))
| ~ big_f(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_f(X1,esk3_2(X1,X2))
| big_f(X2,esk3_2(X1,X2))
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_f(X1,X2)
| big_f(esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_f(X1,esk3_2(X1,X2))
| ~ big_f(X2,esk3_2(X1,X2))
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_f(esk3_2(X1,X2),esk3_2(esk3_2(X1,X2),esk3_2(X1,X2)))
| big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
big_f(X1,X2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_4]),c_0_6]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_7]),c_0_7]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN352+1 : TPTP v9.2.1. Released v2.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.15/0.33 % Computer : n005.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:29:30 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Theorem for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.368s
%------------------------------------------------------------------------------