TSTP Solution File: PUZ128+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PUZ128+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n019.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 : Thu Aug 31 13:12:41 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 25 ( 15 unt; 6 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 6 |; 6 &)
% ( 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 : 3 ( 2 >; 1 *; 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 : 8 ( 0 sgn; 2 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
iokaste: $i ).
tff(decl_23,type,
oedipus: $i ).
tff(decl_24,type,
parent_of: ( $i * $i ) > $o ).
tff(decl_25,type,
polyneikes: $i ).
tff(decl_26,type,
thersandros: $i ).
tff(decl_27,type,
patricide: $i > $o ).
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(iokaste_polyneikes,axiom,
parent_of(iokaste,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_polyneikes) ).
fof(oedipus_polyneikes,axiom,
parent_of(oedipus,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_polyneikes) ).
fof(oedipus_patricidal,axiom,
patricide(oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_patricidal) ).
fof(iokaste_oedipus,axiom,
parent_of(iokaste,oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_oedipus) ).
fof(c_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(c_0_8,negated_conjecture,
! [X3,X4] :
( ~ parent_of(iokaste,X3)
| ~ patricide(X3)
| ~ parent_of(X3,X4)
| patricide(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_9,plain,
~ patricide(thersandros),
inference(fof_simplification,[status(thm)],[thersandros_not_patricidal]) ).
cnf(c_0_10,negated_conjecture,
( patricide(X2)
| ~ parent_of(iokaste,X1)
| ~ patricide(X1)
| ~ parent_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
parent_of(polyneikes,thersandros),
inference(split_conjunct,[status(thm)],[polyneikes_thersandros]) ).
cnf(c_0_12,plain,
parent_of(iokaste,polyneikes),
inference(split_conjunct,[status(thm)],[iokaste_polyneikes]) ).
cnf(c_0_13,plain,
~ patricide(thersandros),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
parent_of(oedipus,polyneikes),
inference(split_conjunct,[status(thm)],[oedipus_polyneikes]) ).
cnf(c_0_15,plain,
patricide(oedipus),
inference(split_conjunct,[status(thm)],[oedipus_patricidal]) ).
cnf(c_0_16,plain,
parent_of(iokaste,oedipus),
inference(split_conjunct,[status(thm)],[iokaste_oedipus]) ).
cnf(c_0_17,negated_conjecture,
~ patricide(polyneikes),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_15]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ128+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.35 % Computer : n019.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sat Aug 26 22:29:28 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.20/0.59 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.005000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.007000 s
%------------------------------------------------------------------------------