%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PUZ128+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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 08:23:21 AM UTC 2026
% Result : Theorem 0.09s 0.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 5 unt; 0 def)
% Number of atoms : 55 ( 21 equ)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 54 ( 8 ~; 3 |; 43 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-4 aty)
% Number of variables : 34 ( 11 sgn 10 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(background,axiom,
? [A,B,C,D,E] :
( ~ ? [F] :
( 'Thersandros' = F
& patricide(F) )
& 'Oedipus' = E
& patricide(E)
& 'Polyneikes' = D
& relation(D,of,'Thersandros')
& parent(D)
& 'Oedipus' = C
& relation(C,of,'Polyneikes')
& parent(C)
& 'Iokaste' = B
& relation(B,of,'Polyneikes')
& parent(B)
& 'Iokaste' = A
& relation(A,of,'Oedipus')
& parent(A) ),
file('theBenchmark.p',background) ).
fof(nnf_1,plain,
! [Oedipus,Iokaste,Polyneikes,Thersandros] :
? [A,B,C,D,E] :
( ! [F] :
( F != Thersandros
| ~ patricide(F) )
& E = Oedipus
& patricide(E)
& D = Polyneikes
& relation(D,of,Thersandros)
& parent(D)
& C = Oedipus
& relation(C,of,Polyneikes)
& parent(C)
& B = Iokaste
& relation(B,of,Polyneikes)
& parent(B)
& Iokaste = A
& relation(A,of,Oedipus)
& parent(A) ),
inference(fof_nnf,[status(thm)],[background]) ).
fof(sk_background,plain,
! [Oedipus,Iokaste,Polyneikes,Thersandros] :
( ! [F] :
( F != Thersandros
| ~ patricide(F) )
& sK0(Oedipus,Iokaste,Polyneikes,Thersandros) = Oedipus
& patricide(sK0(Oedipus,Iokaste,Polyneikes,Thersandros))
& sK4(Oedipus,Iokaste,Polyneikes,Thersandros) = Polyneikes
& relation(sK4(Oedipus,Iokaste,Polyneikes,Thersandros),of,Thersandros)
& parent(sK4(Oedipus,Iokaste,Polyneikes,Thersandros))
& sK3(Oedipus,Iokaste,Polyneikes,Thersandros) = Oedipus
& relation(sK3(Oedipus,Iokaste,Polyneikes,Thersandros),of,Polyneikes)
& parent(sK3(Oedipus,Iokaste,Polyneikes,Thersandros))
& sK2(Oedipus,Iokaste,Polyneikes,Thersandros) = Iokaste
& relation(sK2(Oedipus,Iokaste,Polyneikes,Thersandros),of,Polyneikes)
& parent(sK2(Oedipus,Iokaste,Polyneikes,Thersandros))
& Iokaste = sK1(Oedipus,Iokaste,Polyneikes,Thersandros)
& relation(sK1(Oedipus,Iokaste,Polyneikes,Thersandros),of,Oedipus)
& parent(sK1(Oedipus,Iokaste,Polyneikes,Thersandros)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK0]),skolemize(A,sK1(Oedipus,Iokaste,Polyneikes,Thersandros)),skolemize(B,sK2(Oedipus,Iokaste,Polyneikes,Thersandros)),skolemize(C,sK3(Oedipus,Iokaste,Polyneikes,Thersandros)),skolemize(D,sK4(Oedipus,Iokaste,Polyneikes,Thersandros)),skolemize(E,sK0(Oedipus,Iokaste,Polyneikes,Thersandros))],[nnf_1]) ).
cnf(c_16,plain,
patricide(sK0(A,B,C,D)),
inference(split_conjunct,[status(thm)],[sk_background]) ).
cnf(c_17,plain,
sK0(A,B,C,D) = A,
inference(split_conjunct,[status(thm)],[sk_background]) ).
cnf(c_18,plain,
( A != B
| ~ patricide(A) ),
inference(split_conjunct,[status(thm)],[sk_background]) ).
cnf(c_23,plain,
patricide(A),
inference(paramod,[status(thm)],[c_17,c_16]) ).
cnf(c_25,plain,
A != B,
inference(resolve,[status(thm)],[c_23,c_18]) ).
cnf(c_26,plain,
$false,
inference(resolve,[status(thm)],[c_25,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ128+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n015.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 05:21:28 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 3208173 was started by sandbox2 on n015,
% 0.09/0.36 % Sat Sep 26 05:21:28 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.36
% 0.09/0.36 % From the command line: assign(max_seconds, 300).
% 0.09/0.37
% 0.09/0.37 % SZS status Theorem for theBenchmark
% 0.09/0.37
% 0.09/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.37 % Length of proof is 7.
% 0.09/0.37 % Level of proof is 4.
% 0.09/0.37 % Maximum clause weight is 7.000.
% 0.09/0.37 % Given clauses 0.
% 0.09/0.37
% 0.09/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------