%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN728+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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:39:13 AM UTC 2026
% Result : Theorem 0.09s 5.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 77 ( 26 ~; 25 |; 20 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 54 ( 4 sgn 29 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm69,conjecture,
( ( ! [W] :
( q(W)
=> ~ m(g(W)) )
& ! [R] :
? [S] :
( ( q(f(R,S))
& m(R) )
| p(R,S) )
& ! [X] :
( ? [Y] : p(X,Y)
=> ! [Z] : p(Z,Z) ) )
=> ! [U] :
? [V] :
( p(U,U)
& p(g(U),V) ) ),
file('theBenchmark.p',thm69) ).
fof(thm69_neg,negated_conjecture,
~ ( ( ! [W] :
( q(W)
=> ~ m(g(W)) )
& ! [R] :
? [S] :
( ( q(f(R,S))
& m(R) )
| p(R,S) )
& ! [X] :
( ? [Y] : p(X,Y)
=> ! [Z] : p(Z,Z) ) )
=> ! [U] :
? [V] :
( p(U,U)
& p(g(U),V) ) ),
inference(assume_negation,[status(cth)],[thm69]) ).
fof(nnf_1,plain,
( ? [U] :
! [V] :
( ~ p(U,U)
| ~ p(g(U),V) )
& ! [W] :
( ~ m(g(W))
| ~ q(W) )
& ! [R] :
? [S] :
( ( q(f(R,S))
& m(R) )
| p(R,S) )
& ! [X] :
( ! [Z] : p(Z,Z)
| ! [Y] : ~ p(X,Y) ) ),
inference(fof_nnf,[status(thm)],[thm69_neg]) ).
fof(sk_thm69_neg_sk,plain,
( ! [V] :
( ~ p(sK1,sK1)
| ~ p(g(sK1),V) )
& ! [W] :
( ~ m(g(W))
| ~ q(W) )
& ! [R] :
( ( q(f(R,sK0(R)))
& m(R) )
| p(R,sK0(R)) )
& ! [X] :
( ! [Z] : p(Z,Z)
| ! [Y] : ~ p(X,Y) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(S,sK0(R)),skolemize(U,sK1)],[nnf_1]) ).
fof(sk_thm69_neg,plain,
( ! [VAR_0] :
( ~ p(sK1,sK1)
| ~ p(g(sK1),VAR_0) )
& ! [VAR_0] :
( ~ m(g(VAR_0))
| ~ q(VAR_0) )
& ! [VAR_0] :
( q(f(VAR_0,sK0(VAR_0)))
| p(VAR_0,sK0(VAR_0)) )
& ! [VAR_0] :
( m(VAR_0)
| p(VAR_0,sK0(VAR_0)) )
& ! [VAR_0,VAR_1,VAR_2] :
( p(VAR_2,VAR_2)
| ~ p(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_thm69_neg_sk]) ).
cnf(c_2,negated_conjecture,
( ~ m(g(A))
| ~ q(A) ),
inference(split_conjunct,[status(thm)],[sk_thm69_neg]) ).
cnf(c_3,negated_conjecture,
( m(A)
| p(A,sK0(A)) ),
inference(split_conjunct,[status(thm)],[sk_thm69_neg]) ).
cnf(c_4,negated_conjecture,
( q(f(A,sK0(A)))
| p(A,sK0(A)) ),
inference(split_conjunct,[status(thm)],[sk_thm69_neg]) ).
cnf(c_5,negated_conjecture,
( p(g(A),sK0(g(A)))
| ~ q(A) ),
inference(resolve,[status(thm)],[c_2,c_3]) ).
cnf(c_6,negated_conjecture,
( p(g(f(A,sK0(A))),sK0(g(f(A,sK0(A)))))
| p(A,sK0(A)) ),
inference(resolve,[status(thm)],[c_4,c_5]) ).
cnf(c_7,negated_conjecture,
( p(C,C)
| ~ p(A,B) ),
inference(split_conjunct,[status(thm)],[sk_thm69_neg]) ).
cnf(c_8,negated_conjecture,
( ~ p(sK1,sK1)
| ~ p(g(sK1),A) ),
inference(split_conjunct,[status(thm)],[sk_thm69_neg]) ).
cnf(c_9,plain,
( p(B,sK0(B))
| p(A,A) ),
inference(resolve,[status(thm)],[c_7,c_6]) ).
cnf(c_10,plain,
( ~ p(sK1,sK1)
| p(A,sK0(A)) ),
inference(resolve,[status(thm)],[c_9,c_8]) ).
cnf(c_11,plain,
( p(B,B)
| p(A,A) ),
inference(resolve,[status(thm)],[c_9,c_7]) ).
cnf(c_12,plain,
p(A,A),
inference(factor,[status(thm)],[c_11]) ).
cnf(c_13,plain,
p(A,sK0(A)),
inference(resolve,[status(thm)],[c_12,c_10]) ).
cnf(c_14,negated_conjecture,
~ p(g(sK1),A),
inference(resolve,[status(thm)],[c_12,c_8]) ).
cnf(c_15,plain,
$false,
inference(resolve,[status(thm)],[c_14,c_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN728+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.36 % Computer : n005.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Sat Sep 26 18:22:21 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.37 % Process 2794315 was started by sandbox on n005,
% 0.09/5.37 % Sat Sep 26 18:22:21 2026
% 0.09/5.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/5.37
% 0.09/5.37 % From the command line: assign(max_seconds, 300).
% 0.09/5.38
% 0.09/5.38 % SZS status Theorem for theBenchmark
% 0.09/5.38
% 0.09/5.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/5.38 % Length of proof is 15.
% 0.09/5.38 % Level of proof is 8.
% 0.09/5.38 % Maximum clause weight is 16.000.
% 0.09/5.38 % Given clauses 4.
% 0.09/5.38
% 0.09/5.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------