%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ128+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:03:40 PM UTC 2026
% Result : Theorem 0.19s 1.80s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 15 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 16 ~; 9 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 10 ( 0 sgn 2 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(iokaste_parent_particide_parent_not_patricide,conjecture,
? [X1,X2] :
( parent_of(iokaste,X1)
& patricide(X1)
& parent_of(X1,X2)
& ~ patricide(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_parent_particide_parent_not_patricide) ).
fof(thersandros_not_patricidal,axiom,
~ patricide(thersandros),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thersandros_not_patricidal) ).
fof(polyneikes_thersandros,axiom,
parent_of(polyneikes,thersandros),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',polyneikes_thersandros) ).
fof(oedipus_polyneikes,axiom,
parent_of(oedipus,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_polyneikes) ).
fof(iokaste_polyneikes,axiom,
parent_of(iokaste,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_polyneikes) ).
fof(iokaste_oedipus,axiom,
parent_of(iokaste,oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_oedipus) ).
fof(oedipus_patricidal,axiom,
patricide(oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_patricidal) ).
fof(i_0_7,negated_conjecture,
~ ? [X1,X2] :
( parent_of(iokaste,X1)
& patricide(X1)
& parent_of(X1,X2)
& ~ patricide(X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[iokaste_parent_particide_parent_not_patricide])]) ).
fof(i_0_8,negated_conjecture,
! [X5,X6] :
( ~ parent_of(iokaste,X5)
| ~ patricide(X5)
| ~ parent_of(X5,X6)
| patricide(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_7])]) ).
fof(i_0_9,plain,
~ patricide(thersandros),
inference(fof_simplification,[status(thm)],[thersandros_not_patricidal]) ).
cnf(i_0_10,negated_conjecture,
( patricide(X2)
| ~ parent_of(iokaste,X1)
| ~ patricide(X1)
| ~ parent_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_11,plain,
parent_of(polyneikes,thersandros),
inference(split_conjunct,[status(thm)],[polyneikes_thersandros]),
[final] ).
cnf(i_0_12,plain,
parent_of(oedipus,polyneikes),
inference(split_conjunct,[status(thm)],[oedipus_polyneikes]),
[final] ).
cnf(i_0_13,plain,
parent_of(iokaste,polyneikes),
inference(split_conjunct,[status(thm)],[iokaste_polyneikes]),
[final] ).
cnf(i_0_14,plain,
parent_of(iokaste,oedipus),
inference(split_conjunct,[status(thm)],[iokaste_oedipus]),
[final] ).
cnf(i_0_15,plain,
~ patricide(thersandros),
inference(split_conjunct,[status(thm)],[i_0_9]),
[final] ).
cnf(i_0_16,plain,
patricide(oedipus),
inference(split_conjunct,[status(thm)],[oedipus_patricidal]),
[final] ).
cnf(i_0_17,plain,
~ patricide(polyneikes),
inference(scs_inference,[],[i_0_11,i_0_15,i_0_13,i_0_10]) ).
cnf(i_0_18,plain,
( ~ parent_of(iokaste,X1)
| ~ patricide(X1)
| ~ parent_of(X1,X2)
| patricide(X2) ),
inference(rename_variables,[],[i_0_10]) ).
cnf(i_0_19,plain,
$false,
inference(scs_inference,[],[i_0_17,i_0_12,i_0_14,i_0_16,i_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.21 % Problem : PUZ128+1 : TPTP v9.2.1. Released v4.0.0.
% 0.02/0.21 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.12/0.51 % Computer : n022.cluster.edu
% 0.12/0.51 % Model : x86_64 x86_64
% 0.12/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.51 % Memory : 8042.1875MB
% 0.12/0.51 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.51 % CPULimit : 300
% 0.12/0.51 % WCLimit : 300
% 0.12/0.51 % DateTime : Tue May 5 01:35:51 EDT 2026
% 0.12/0.51 % CPUTime :
% 0.12/0.52 % start to proof: theBenchmark
% 0.19/1.80 % Version : CSE_E---1.7
% 0.19/1.80 % Problem : theBenchmark.p
% 0.19/1.80 % SZS status Theorem for theBenchmark.p
% 0.19/1.80 % SZS output start CNFRefutation
% See solution above
% 0.19/1.83 % Total time : 1.280s
%------------------------------------------------------------------------------