%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN341+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 09:37:37 AM UTC 2026
% Result : Theorem 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 3 unt; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 18 ( 1 sgn 8 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_15_6,conjecture,
? [X1] :
! [X2] :
? [X3] :
! [X4] :
( big_f(X1,X2,X3)
=> big_f(X2,X3,X4) ),
file('theBenchmark.p',church_46_15_6) ).
fof(church_46_15_6_neg,negated_conjecture,
~ ? [X1] :
! [X2] :
? [X3] :
! [X4] :
( big_f(X1,X2,X3)
=> big_f(X2,X3,X4) ),
inference(assume_negation,[status(cth)],[church_46_15_6]) ).
fof(nnf_1,plain,
! [X1] :
? [X2] :
! [X3] :
? [X4] :
( ~ big_f(X2,X3,X4)
& big_f(X1,X2,X3) ),
inference(fof_nnf,[status(thm)],[church_46_15_6_neg]) ).
fof(sk_church_46_15_6_neg,plain,
! [X1,X3] :
( ~ big_f(sK0(X1),X3,sK1(X1,X3))
& big_f(X1,sK0(X1),X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X1)),skolemize(X4,sK1(X1,X3))],[nnf_1]) ).
cnf(c_2,negated_conjecture,
~ big_f(sK0(A),B,sK1(A,B)),
inference(split_conjunct,[status(thm)],[sk_church_46_15_6_neg]) ).
cnf(c_3,negated_conjecture,
big_f(A,sK0(A),B),
inference(split_conjunct,[status(thm)],[sk_church_46_15_6_neg]) ).
cnf(c_4,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_2,c_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN341+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 17:38:50 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 2306471 was started by sandbox2 on n002,
% 0.09/0.37 % Sat Sep 26 17:38:50 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Theorem for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 4.
% 0.09/0.38 % Level of proof is 2.
% 0.09/0.38 % Maximum clause weight is 0.000.
% 0.09/0.38 % Given clauses 0.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------