%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : PUZ128+1 : TPTP v9.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n014.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 : Wed Apr 9 08:25:19 PM UTC 2025
% Result : Theorem 2.63s 1.66s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 8 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 4 ( 2 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ parent_of > patricide > #nlpp > thersandros > polyneikes > oedipus > iokaste
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(parent_of,type,
parent_of: ( $i * $i ) > $o ).
tff(polyneikes,type,
polyneikes: $i ).
tff(iokaste,type,
iokaste: $i ).
tff(oedipus,type,
oedipus: $i ).
tff(thersandros,type,
thersandros: $i ).
tff(patricide,type,
patricide: $i > $o ).
tff(f_41,axiom,
~ patricide(thersandros),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thersandros_not_patricidal) ).
tff(f_32,axiom,
parent_of(iokaste,polyneikes),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',iokaste_polyneikes) ).
tff(f_36,axiom,
parent_of(polyneikes,thersandros),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',polyneikes_thersandros) ).
tff(f_53,negated_conjecture,
~ ? [P,NP] :
( parent_of(iokaste,P)
& patricide(P)
& parent_of(P,NP)
& ~ patricide(NP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',iokaste_parent_particide_parent_not_patricide) ).
tff(f_30,axiom,
parent_of(iokaste,oedipus),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',iokaste_oedipus) ).
tff(f_38,axiom,
patricide(oedipus),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oedipus_patricidal) ).
tff(f_34,axiom,
parent_of(oedipus,polyneikes),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oedipus_polyneikes) ).
tff(c_12,plain,
~ patricide(thersandros),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_4,plain,
parent_of(iokaste,polyneikes),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_8,plain,
parent_of(polyneikes,thersandros),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_15,plain,
! [NP_3,P_4] :
( patricide(NP_3)
| ~ parent_of(P_4,NP_3)
| ~ patricide(P_4)
| ~ parent_of(iokaste,P_4) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_19,plain,
( patricide(thersandros)
| ~ patricide(polyneikes)
| ~ parent_of(iokaste,polyneikes) ),
inference(resolution,[status(thm)],[c_8,c_15]) ).
tff(c_28,plain,
( patricide(thersandros)
| ~ patricide(polyneikes) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_19]) ).
tff(c_29,plain,
~ patricide(polyneikes),
inference(negUnitSimplification,[status(thm)],[c_12,c_28]) ).
tff(c_2,plain,
parent_of(iokaste,oedipus),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_10,plain,
patricide(oedipus),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_6,plain,
parent_of(oedipus,polyneikes),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_21,plain,
( patricide(polyneikes)
| ~ patricide(oedipus)
| ~ parent_of(iokaste,oedipus) ),
inference(resolution,[status(thm)],[c_6,c_15]) ).
tff(c_32,plain,
patricide(polyneikes),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_10,c_21]) ).
tff(c_34,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_29,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : PUZ128+1 : TPTP v9.0.0. Released v4.0.0.
% 0.12/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Apr 8 17:34:34 EDT 2025
% 0.13/0.35 % CPUTime :
% 2.63/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.63/1.66
% 2.63/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------