%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PUZ128+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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 : Thu Sep 24 08:54:30 AM UTC 2026
% Result : Theorem 0.09s 0.40s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 31 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 28 ~; 21 |; 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 : 14 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(iokaste_oedipus,axiom,
parent_of(iokaste,oedipus),
file('theBenchmark.p',iokaste_oedipus) ).
fof(iokaste_polyneikes,axiom,
parent_of(iokaste,polyneikes),
file('theBenchmark.p',iokaste_polyneikes) ).
fof(oedipus_polyneikes,axiom,
parent_of(oedipus,polyneikes),
file('theBenchmark.p',oedipus_polyneikes) ).
fof(polyneikes_thersandros,axiom,
parent_of(polyneikes,thersandros),
file('theBenchmark.p',polyneikes_thersandros) ).
fof(oedipus_patricidal,axiom,
patricide(oedipus),
file('theBenchmark.p',oedipus_patricidal) ).
fof(thersandros_not_patricidal,axiom,
~ patricide(thersandros),
file('theBenchmark.p',thersandros_not_patricidal) ).
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(f_1_1,plain,
parent_of(iokaste,oedipus),
inference(fof_nnf,[status(thm)],[iokaste_oedipus]) ).
cnf(f_1_2,plain,
parent_of(iokaste,oedipus),
inference(clausify,[status(thm)],[f_1_1]) ).
fof(f_2_1,plain,
parent_of(iokaste,polyneikes),
inference(fof_nnf,[status(thm)],[iokaste_polyneikes]) ).
cnf(f_2_2,plain,
parent_of(iokaste,polyneikes),
inference(clausify,[status(thm)],[f_2_1]) ).
fof(f_3_1,plain,
parent_of(oedipus,polyneikes),
inference(fof_nnf,[status(thm)],[oedipus_polyneikes]) ).
cnf(f_3_2,plain,
parent_of(oedipus,polyneikes),
inference(clausify,[status(thm)],[f_3_1]) ).
fof(f_4_1,plain,
parent_of(polyneikes,thersandros),
inference(fof_nnf,[status(thm)],[polyneikes_thersandros]) ).
cnf(f_4_2,plain,
parent_of(polyneikes,thersandros),
inference(clausify,[status(thm)],[f_4_1]) ).
fof(f_5_1,plain,
patricide(oedipus),
inference(fof_nnf,[status(thm)],[oedipus_patricidal]) ).
cnf(f_5_2,plain,
patricide(oedipus),
inference(clausify,[status(thm)],[f_5_1]) ).
fof(f_6_1,plain,
~ patricide(thersandros),
inference(fof_nnf,[status(thm)],[thersandros_not_patricidal]) ).
cnf(f_6_2,plain,
~ patricide(thersandros),
inference(clausify,[status(thm)],[f_6_1]) ).
fof(f_7_1,negated_conjecture,
~ ? [P,NP] :
( ~ patricide(NP)
& parent_of(P,NP)
& patricide(P)
& parent_of(iokaste,P) ),
inference(negate,[status(cth)],[iokaste_parent_particide_parent_not_patricide]) ).
fof(f_7_2,negated_conjecture,
! [P,NP] :
( patricide(NP)
| ~ parent_of(P,NP)
| ~ patricide(P)
| ~ parent_of(iokaste,P) ),
inference(fof_nnf,[status(thm)],[f_7_1]) ).
fof(f_7_3,negated_conjecture,
! [U_1,U_0] :
( patricide(U_0)
| ~ parent_of(U_1,U_0)
| ~ patricide(U_1)
| ~ parent_of(iokaste,U_1) ),
inference(variable_rename,[status(thm)],[f_7_2]) ).
fof(f_7_4,negated_conjecture,
! [U_1] :
( ! [U_0] :
( patricide(U_0)
| ~ parent_of(U_1,U_0) )
| ~ patricide(U_1)
| ~ parent_of(iokaste,U_1) ),
inference(miniscope,[status(thm)],[f_7_3]) ).
fof(f_7_5,negated_conjecture,
! [U_0,U_1] :
( patricide(U_0)
| ~ parent_of(U_1,U_0)
| ~ patricide(U_1)
| ~ parent_of(iokaste,U_1) ),
inference(definitional_conversion,[status(esa)],[f_7_4]) ).
cnf(f_7_6,negated_conjecture,
( patricide(U_0)
| ~ parent_of(U_1,U_0)
| ~ patricide(U_1)
| ~ parent_of(iokaste,U_1) ),
inference(clausify,[status(thm)],[f_7_5]) ).
cnf(t1,plain,
~ patricide(thersandros),
inference(start,[status(thm),parent(0:0)],[f_6_2]) ).
cnf(t2,plain,
( ~ patricide(polyneikes)
| ~ parent_of(polyneikes,thersandros)
| ~ parent_of(iokaste,polyneikes)
| patricide(thersandros) ),
inference(extension,[status(thm),parent(t1:1)],[f_7_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
parent_of(iokaste,polyneikes),
inference(extension,[status(thm),parent(t2:2)],[f_2_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
parent_of(polyneikes,thersandros),
inference(extension,[status(thm),parent(t2:3)],[f_4_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( ~ patricide(oedipus)
| ~ parent_of(oedipus,polyneikes)
| ~ parent_of(iokaste,oedipus)
| patricide(polyneikes) ),
inference(extension,[status(thm),parent(t2:4)],[f_7_6]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
cnf(t10,plain,
parent_of(iokaste,oedipus),
inference(extension,[status(thm),parent(t8:2)],[f_1_2]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
parent_of(oedipus,polyneikes),
inference(extension,[status(thm),parent(t8:3)],[f_3_2]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
cnf(t14,plain,
patricide(oedipus),
inference(extension,[status(thm),parent(t8:4)],[f_5_2]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t8:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ128+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n017.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 19 19:59:55 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.40 % SZS status Theorem for theBenchmark
% 0.09/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------