%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PUZ128+1 : 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 : n014.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:20 AM UTC 2026
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 15 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 15 ~; 9 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 0 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(iokaste_parent_particide_parent_not_patricide,conjecture,
? [P,NP] :
( ~ patricide(NP)
& parent_of(P,NP)
& patricide(P)
& parent_of(iokaste,P) ),
file('theBenchmark.p',iokaste_parent_particide_parent_not_patricide) ).
fof(iokaste_parent_particide_parent_not_patricide_neg,negated_conjecture,
~ ? [P,NP] :
( ~ patricide(NP)
& parent_of(P,NP)
& patricide(P)
& parent_of(iokaste,P) ),
inference(assume_negation,[status(cth)],[iokaste_parent_particide_parent_not_patricide]) ).
fof(iokaste_oedipus,axiom,
parent_of(iokaste,oedipus),
file('theBenchmark.p',iokaste_oedipus) ).
cnf(c_2,plain,
parent_of(iokaste,oedipus),
inference(clausify,[status(thm)],[iokaste_oedipus]) ).
fof(iokaste_polyneikes,axiom,
parent_of(iokaste,polyneikes),
file('theBenchmark.p',iokaste_polyneikes) ).
cnf(c_3,plain,
parent_of(iokaste,polyneikes),
inference(clausify,[status(thm)],[iokaste_polyneikes]) ).
fof(oedipus_polyneikes,axiom,
parent_of(oedipus,polyneikes),
file('theBenchmark.p',oedipus_polyneikes) ).
cnf(c_4,plain,
parent_of(oedipus,polyneikes),
inference(clausify,[status(thm)],[oedipus_polyneikes]) ).
fof(polyneikes_thersandros,axiom,
parent_of(polyneikes,thersandros),
file('theBenchmark.p',polyneikes_thersandros) ).
cnf(c_5,plain,
parent_of(polyneikes,thersandros),
inference(clausify,[status(thm)],[polyneikes_thersandros]) ).
fof(oedipus_patricidal,axiom,
patricide(oedipus),
file('theBenchmark.p',oedipus_patricidal) ).
cnf(c_6,plain,
patricide(oedipus),
inference(clausify,[status(thm)],[oedipus_patricidal]) ).
fof(thersandros_not_patricidal,axiom,
~ patricide(thersandros),
file('theBenchmark.p',thersandros_not_patricidal) ).
cnf(c_7,plain,
~ patricide(thersandros),
inference(clausify,[status(thm)],[thersandros_not_patricidal]) ).
cnf(c_8,negated_conjecture,
( patricide(B)
| ~ parent_of(A,B)
| ~ patricide(A)
| ~ parent_of(iokaste,A) ),
inference(clausify,[status(thm)],[iokaste_parent_particide_parent_not_patricide_neg]) ).
cnf(c_13,negated_conjecture,
( patricide(A)
| ~ parent_of(oedipus,A)
| ~ patricide(oedipus) ),
inference(resolve,[status(thm)],[c_8,c_2]) ).
cnf(c_14,negated_conjecture,
( patricide(A)
| ~ parent_of(oedipus,A) ),
inference(resolve,[status(thm)],[c_13,c_6]) ).
cnf(c_10,negated_conjecture,
patricide(polyneikes),
inference(resolve,[status(thm)],[c_14,c_4]) ).
cnf(c_15,negated_conjecture,
( patricide(A)
| ~ parent_of(polyneikes,A)
| ~ patricide(polyneikes) ),
inference(resolve,[status(thm)],[c_8,c_3]) ).
cnf(c_16,negated_conjecture,
( patricide(thersandros)
| ~ patricide(polyneikes) ),
inference(resolve,[status(thm)],[c_15,c_5]) ).
cnf(c_11,negated_conjecture,
~ patricide(polyneikes),
inference(resolve,[status(thm)],[c_16,c_7]) ).
cnf(c_12,plain,
$false,
inference(resolve,[status(thm)],[c_11,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ128+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 05:18:01 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.13/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.36 % Process 2227500 was started by sandbox2 on n014,
% 0.13/0.36 % Sat Sep 26 05:18:01 2026
% 0.13/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.37
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37
% 0.13/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.37 % Length of proof is 11.
% 0.13/0.37 % Level of proof is 3.
% 0.13/0.37 % Maximum clause weight is 10.000.
% 0.13/0.37 % Given clauses 7.
% 0.13/0.37
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------