%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN074+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:36:58 AM UTC 2026
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of formulae : 37 ( 6 unt; 0 def)
% Number of atoms : 121 ( 77 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 140 ( 56 ~; 63 |; 16 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 2 sgn 30 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel51_1,axiom,
? [Z,W] :
! [X,Y] :
( big_f(X,Y)
<=> ( Y = W
& X = Z ) ),
file('theBenchmark.p',pel51_1) ).
fof(pel51,conjecture,
? [Z] :
! [X] :
( ? [W] :
! [Y] :
( big_f(X,Y)
<=> Y = W )
<=> X = Z ),
file('theBenchmark.p',pel51) ).
fof(pel51_neg,negated_conjecture,
~ ? [Z] :
! [X] :
( ? [W] :
! [Y] :
( big_f(X,Y)
<=> Y = W )
<=> X = Z ),
inference(assume_negation,[status(cth)],[pel51]) ).
fof(nnf_1,plain,
? [Z,W] :
! [X,Y] :
( ( W != Y
| Z != X
| big_f(X,Y) )
& ( ( W = Y
& Z = X )
| ~ big_f(X,Y) ) ),
inference(fof_nnf,[status(thm)],[pel51_1]) ).
fof(sk_pel51_1_sk,plain,
! [X,Y] :
( ( sK1 != Y
| sK0 != X
| big_f(X,Y) )
& ( ( sK1 = Y
& sK0 = X )
| ~ big_f(X,Y) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(Z,sK0),skolemize(W,sK1)],[nnf_1]) ).
fof(sk_pel51_1,plain,
( ! [VAR_0,VAR_1] :
( sK1 != VAR_1
| sK0 != VAR_0
| big_f(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( sK1 = VAR_1
| ~ big_f(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( sK0 = VAR_0
| ~ big_f(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_pel51_1_sk]) ).
cnf(c_3,plain,
( sK0 = A
| ~ big_f(A,B) ),
inference(split_conjunct,[status(thm)],[sk_pel51_1]) ).
cnf(c_4,plain,
( sK1 = B
| ~ big_f(A,B) ),
inference(split_conjunct,[status(thm)],[sk_pel51_1]) ).
cnf(c_5,plain,
( sK1 != B
| sK0 != A
| big_f(A,B) ),
inference(split_conjunct,[status(thm)],[sk_pel51_1]) ).
fof(nnf_2,plain,
! [Z] :
? [X] :
( ( Z != X
| ! [W] :
? [Y] :
( ( W != Y
| ~ big_f(X,Y) )
& ( W = Y
| big_f(X,Y) ) ) )
& ( Z = X
| ? [X0] :
! [X1] :
( ( X0 != X1
| big_f(X,X1) )
& ( X0 = X1
| ~ big_f(X,X1) ) ) ) ),
inference(fof_nnf,[status(thm)],[pel51_neg]) ).
fof(sk_pel51_neg_sk,plain,
! [Z] :
( ( Z != sK2(Z)
| ! [W] :
( ( W != sK4(Z,W)
| ~ big_f(sK2(Z),sK4(Z,W)) )
& ( W = sK4(Z,W)
| big_f(sK2(Z),sK4(Z,W)) ) ) )
& ( Z = sK2(Z)
| ! [X1] :
( ( sK3(Z) != X1
| big_f(sK2(Z),X1) )
& ( sK3(Z) = X1
| ~ big_f(sK2(Z),X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X,sK2(Z)),skolemize(X0,sK3(Z)),skolemize(Y,sK4(Z,W))],[nnf_2]) ).
fof(sk_pel51_neg,plain,
( ! [VAR_0,VAR_1] :
( VAR_0 != sK2(VAR_0)
| VAR_1 != sK4(VAR_0,VAR_1)
| ~ big_f(sK2(VAR_0),sK4(VAR_0,VAR_1)) )
& ! [VAR_0,VAR_1] :
( VAR_0 != sK2(VAR_0)
| VAR_1 = sK4(VAR_0,VAR_1)
| big_f(sK2(VAR_0),sK4(VAR_0,VAR_1)) )
& ! [VAR_0,VAR_1] :
( VAR_0 = sK2(VAR_0)
| sK3(VAR_0) != VAR_1
| big_f(sK2(VAR_0),VAR_1) )
& ! [VAR_0,VAR_1] :
( VAR_0 = sK2(VAR_0)
| sK3(VAR_0) = VAR_1
| ~ big_f(sK2(VAR_0),VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_pel51_neg_sk]) ).
cnf(c_8,negated_conjecture,
( A = sK2(A)
| sK3(A) != B
| big_f(sK2(A),B) ),
inference(split_conjunct,[status(thm)],[sk_pel51_neg]) ).
cnf(c_9,negated_conjecture,
( sK2(A) = A
| sK3(A) != B
| big_f(sK2(A),B) ),
inference(copy,[status(thm)],[c_8]) ).
cnf(c_10,negated_conjecture,
( A != sK2(A)
| B = sK4(A,B)
| big_f(sK2(A),sK4(A,B)) ),
inference(split_conjunct,[status(thm)],[sk_pel51_neg]) ).
cnf(c_37,negated_conjecture,
( A != sK2(A)
| sK4(A,B) = B
| big_f(sK2(A),sK4(A,B)) ),
inference(copy,[status(thm)],[c_10]) ).
cnf(c_11,negated_conjecture,
( sK2(A) != A
| sK4(A,B) = B
| big_f(sK2(A),sK4(A,B)) ),
inference(copy,[status(thm)],[c_37]) ).
cnf(c_12,negated_conjecture,
( A != sK2(A)
| B != sK4(A,B)
| ~ big_f(sK2(A),sK4(A,B)) ),
inference(split_conjunct,[status(thm)],[sk_pel51_neg]) ).
cnf(c_38,negated_conjecture,
( A != sK2(A)
| sK4(A,B) != B
| ~ big_f(sK2(A),sK4(A,B)) ),
inference(copy,[status(thm)],[c_12]) ).
cnf(c_13,negated_conjecture,
( sK2(A) != A
| sK4(A,B) != B
| ~ big_f(sK2(A),sK4(A,B)) ),
inference(copy,[status(thm)],[c_38]) ).
cnf(c_14,plain,
( sK1 != A
| big_f(sK0,A) ),
inference(xxres,[status(thm)],[c_5]) ).
cnf(c_16,plain,
( sK2(A) = A
| big_f(sK2(A),sK3(A)) ),
inference(xxres,[status(thm)],[c_9]) ).
cnf(c_17,plain,
big_f(sK0,sK1),
inference(xxres,[status(thm)],[c_14]) ).
cnf(c_39,plain,
( sK0 = sK2(A)
| sK2(A) = A ),
inference(resolve,[status(thm)],[c_16,c_3]) ).
cnf(c_19,plain,
( sK2(A) = sK0
| sK2(A) = A ),
inference(copy,[status(thm)],[c_39]) ).
cnf(c_20,plain,
sK2(sK0) = sK0,
inference(factor,[status(thm)],[c_19]) ).
cnf(c_40,negated_conjecture,
( sK4(sK0,A) = A
| big_f(sK2(sK0),sK4(sK0,A)) ),
inference(resolve,[status(thm)],[c_20,c_11]) ).
cnf(c_21,negated_conjecture,
( sK4(sK0,A) = A
| big_f(sK0,sK4(sK0,A)) ),
inference(paramod,[status(thm)],[c_20,c_40]) ).
cnf(c_41,plain,
( sK2(sK0) != sK0
| sK4(sK0,A) != A
| ~ big_f(sK0,sK4(sK0,A)) ),
inference(paramod,[status(thm)],[c_20,c_13]) ).
cnf(c_42,plain,
( sK0 != sK0
| sK4(sK0,A) != A
| ~ big_f(sK0,sK4(sK0,A)) ),
inference(paramod,[status(thm)],[c_20,c_41]) ).
cnf(c_22,plain,
( sK4(sK0,A) != A
| ~ big_f(sK0,sK4(sK0,A)) ),
inference(copy,[status(thm)],[c_42]) ).
cnf(c_43,plain,
( sK1 = sK4(sK0,A)
| sK4(sK0,A) = A ),
inference(resolve,[status(thm)],[c_21,c_4]) ).
cnf(c_34,plain,
( sK4(sK0,A) = sK1
| sK4(sK0,A) = A ),
inference(copy,[status(thm)],[c_43]) ).
cnf(c_35,plain,
sK4(sK0,sK1) = sK1,
inference(factor,[status(thm)],[c_34]) ).
cnf(c_44,plain,
~ big_f(sK0,sK4(sK0,sK1)),
inference(resolve,[status(thm)],[c_22,c_35]) ).
cnf(c_45,plain,
~ big_f(sK0,sK1),
inference(paramod,[status(thm)],[c_35,c_44]) ).
cnf(c_36,plain,
$false,
inference(resolve,[status(thm)],[c_17,c_45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN074+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41 % Computer : n015.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Sat Sep 26 17:13:13 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.41 % Process 358929 was started by sandbox on n015,
% 0.15/0.41 % Sat Sep 26 17:13:13 2026
% 0.15/0.41 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.42
% 0.15/0.42 % From the command line: assign(max_seconds, 300).
% 0.15/0.43
% 0.15/0.43 % SZS status Theorem for theBenchmark
% 0.15/0.43
% 0.15/0.43 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.43 % Length of proof is 21.
% 0.15/0.43 % Level of proof is 9.
% 0.15/0.43 % Maximum clause weight is 15.000.
% 0.15/0.43 % Given clauses 20.
% 0.15/0.43
% 0.15/0.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------