%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN336+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 : n023.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:50 PM UTC 2026
% Result : Theorem 0.20s 1.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 3 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 15 ( 3 ~; 0 |; 4 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 13 ( 2 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_15_1,conjecture,
! [X1] :
? [X2,X3] :
! [X4] :
( big_f(X1,X4)
=> ( big_f(X2,X4)
=> ( big_f(X3,X4)
=> ( big_f(X2,X1)
=> big_f(X4,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_15_1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
? [X2,X3] :
! [X4] :
( big_f(X1,X4)
=> ( big_f(X2,X4)
=> ( big_f(X3,X4)
=> ( big_f(X2,X1)
=> big_f(X4,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[church_46_15_1]) ).
fof(c_0_2,negated_conjecture,
! [X10,X11] :
( big_f(esk1_0,esk2_2(X10,X11))
& big_f(X10,esk2_2(X10,X11))
& big_f(X11,esk2_2(X10,X11))
& big_f(X10,esk1_0)
& ~ big_f(esk2_2(X10,X11),X11) ),
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(esk2_2(X1,X2),X2),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
big_f(X1,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_3,c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN336+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.09 % 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.11/0.29 % Computer : n023.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue May 5 08:29:38 EDT 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.30 % start to proof: theBenchmark
% 0.20/1.57 % Version : CSE_E---1.7
% 0.20/1.57 % Problem : theBenchmark.p
% 0.20/1.57 % SZS status Theorem for theBenchmark.p
% 0.20/1.57 % SZS output start CNFRefutation
% See solution above
% 0.20/1.57 % Total time : 1.267s
%------------------------------------------------------------------------------