%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUN060+1 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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 08:19:19 AM UTC 2026
% Result : Theorem 0.11s 0.42s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 93 ( 31 ~; 23 |; 39 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 0 con; 1-2 aty)
% Number of variables : 107 ( 31 sgn 14 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_6,axiom,
! [X21,X22] :
( id(X22,X21)
| ~ id(X21,X22) ),
file('theBenchmark.p',axiom_6) ).
fof(axiom_2a,axiom,
! [X2,X9] :
? [Y2] :
( ? [Y6] :
( r4(X2,X9,Y6)
& r3(Y6,X2,Y2) )
& ? [Y3] :
( ? [Y14] :
( r4(X2,Y14,Y3)
& r2(X9,Y14) )
& id(Y3,Y2) ) ),
file('theBenchmark.p',axiom_2a) ).
fof(axiom_4a,axiom,
! [X4] :
? [Y9] :
( ? [Y16] :
( r3(X4,Y16,Y9)
& r1(Y16) )
& id(Y9,X4) ),
file('theBenchmark.p',axiom_4a) ).
fof(axiom_5a,axiom,
! [X5] :
? [Y8] :
( ? [Y18] :
( r1(Y18)
& id(Y8,Y18) )
& ? [Y17] :
( r4(X5,Y17,Y8)
& r1(Y17) ) ),
file('theBenchmark.p',axiom_5a) ).
fof(greq4id,conjecture,
? [Y1,Y2,Y3] :
( ? [Y4] :
( ? [Y5] :
( ? [Y6] :
( ? [Y7] :
( ? [Y8] :
( r2(Y8,Y7)
& r1(Y8) )
& r2(Y7,Y6) )
& r2(Y6,Y5) )
& r2(Y5,Y4) )
& r3(Y2,Y4,Y3) )
& id(Y3,Y1) ),
file('theBenchmark.p',greq4id) ).
fof(greq4id_neg,negated_conjecture,
~ ? [Y1,Y2,Y3] :
( ? [Y4] :
( ? [Y5] :
( ? [Y6] :
( ? [Y7] :
( ? [Y8] :
( r2(Y8,Y7)
& r1(Y8) )
& r2(Y7,Y6) )
& r2(Y6,Y5) )
& r2(Y5,Y4) )
& r3(Y2,Y4,Y3) )
& id(Y3,Y1) ),
inference(assume_negation,[status(cth)],[greq4id]) ).
cnf(c_29,plain,
( id(B,A)
| ~ id(A,B) ),
inference(clausify,[status(thm)],[axiom_6]) ).
fof(nnf_13,plain,
! [X2,X9] :
? [Y2] :
( ? [Y6] :
( r4(X2,X9,Y6)
& r3(Y6,X2,Y2) )
& ? [Y3] :
( ? [Y14] :
( r4(X2,Y14,Y3)
& r2(X9,Y14) )
& id(Y3,Y2) ) ),
inference(fof_nnf,[status(thm)],[axiom_2a]) ).
fof(sk_axiom_2a,plain,
! [X2,X9] :
( r4(X2,X9,sK1(X2,X9))
& r3(sK1(X2,X9),X2,sK2(X2,X9))
& r4(X2,sK0(X2,X9),sK5(X2,X9))
& r2(X9,sK0(X2,X9))
& id(sK5(X2,X9),sK2(X2,X9)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK2,sK0,sK1]),skolemize(Y2,sK2(X2,X9)),skolemize(Y3,sK5(X2,X9)),skolemize(Y14,sK0(X2,X9)),skolemize(Y6,sK1(X2,X9))],[nnf_13]) ).
cnf(c_45,plain,
r2(A,sK0(B,A)),
inference(split_conjunct,[status(thm)],[sk_axiom_2a]) ).
cnf(c_47,plain,
r3(sK1(A,B),A,sK2(A,B)),
inference(split_conjunct,[status(thm)],[sk_axiom_2a]) ).
fof(nnf_15,plain,
! [X4] :
? [Y9] :
( ? [Y16] :
( r3(X4,Y16,Y9)
& r1(Y16) )
& id(Y9,X4) ),
inference(fof_nnf,[status(thm)],[axiom_4a]) ).
fof(sk_axiom_4a,plain,
! [X4] :
( r3(X4,sK6(X4),sK3(X4))
& r1(sK6(X4))
& id(sK3(X4),X4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK6]),skolemize(Y9,sK3(X4)),skolemize(Y16,sK6(X4))],[nnf_15]) ).
cnf(c_50,plain,
id(sK3(A),A),
inference(split_conjunct,[status(thm)],[sk_axiom_4a]) ).
fof(nnf_16,plain,
! [X5] :
? [Y8] :
( ? [Y18] :
( r1(Y18)
& id(Y8,Y18) )
& ? [Y17] :
( r4(X5,Y17,Y8)
& r1(Y17) ) ),
inference(fof_nnf,[status(thm)],[axiom_5a]) ).
fof(sk_axiom_5a,plain,
! [X5] :
( r1(sK4(X5))
& id(sK8(X5),sK4(X5))
& r4(X5,sK7(X5),sK8(X5))
& r1(sK7(X5)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK4]),skolemize(Y8,sK8(X5)),skolemize(Y17,sK7(X5)),skolemize(Y18,sK4(X5))],[nnf_16]) ).
cnf(c_56,plain,
r1(sK4(A)),
inference(split_conjunct,[status(thm)],[sk_axiom_5a]) ).
cnf(c_62,negated_conjecture,
( ~ r2(V7,V6)
| ~ r1(V7)
| ~ r2(V6,F)
| ~ r2(F,E)
| ~ r2(E,D)
| ~ r3(C,D,A)
| ~ id(A,B) ),
inference(clausify,[status(thm)],[greq4id_neg]) ).
cnf(c_143,plain,
id(A,sK3(A)),
inference(resolve,[status(thm)],[c_50,c_29]) ).
cnf(c_211,negated_conjecture,
( ~ r2(V6,F)
| ~ r1(V6)
| ~ r2(F,E)
| ~ r2(E,D)
| ~ r2(D,A)
| ~ id(sK2(A,B),C) ),
inference(resolve,[status(thm)],[c_62,c_47]) ).
cnf(c_212,negated_conjecture,
( ~ r2(V6,F)
| ~ r1(V6)
| ~ r2(F,E)
| ~ r2(E,B)
| ~ id(sK2(sK0(A,B),C),D) ),
inference(resolve,[status(thm)],[c_211,c_45]) ).
cnf(c_213,negated_conjecture,
( ~ r2(V6,F)
| ~ r1(V6)
| ~ r2(F,C)
| ~ id(sK2(sK0(A,sK0(B,C)),D),E) ),
inference(resolve,[status(thm)],[c_212,c_45]) ).
cnf(c_214,negated_conjecture,
( ~ r2(V6,D)
| ~ r1(V6)
| ~ id(sK2(sK0(A,sK0(B,sK0(C,D))),E),F) ),
inference(resolve,[status(thm)],[c_213,c_45]) ).
cnf(c_215,negated_conjecture,
( ~ r2(sK4(V6),D)
| ~ id(sK2(sK0(A,sK0(B,sK0(C,D))),E),F) ),
inference(resolve,[status(thm)],[c_214,c_56]) ).
cnf(c_209,negated_conjecture,
~ id(sK2(sK0(A,sK0(B,sK0(C,sK0(D,sK4(E))))),F),V6),
inference(resolve,[status(thm)],[c_215,c_45]) ).
cnf(c_210,plain,
$false,
inference(resolve,[status(thm)],[c_209,c_143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN060+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 26 04:28:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37 % Process 3771677 was started by sandbox2 on n011,
% 0.11/0.37 % Sat Sep 26 04:28:13 2026
% 0.11/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.38
% 0.11/0.38 % From the command line: assign(max_seconds, 300).
% 0.11/0.42
% 0.11/0.42 % SZS status Theorem for theBenchmark
% 0.11/0.42
% 0.11/0.42 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.11/0.42 % Length of proof is 14.
% 0.11/0.42 % Level of proof is 3.
% 0.11/0.42 % Maximum clause weight is 21.000.
% 0.11/0.42 % Given clauses 43.
% 0.11/0.42
% 0.11/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------