%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ128+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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 : 600s
% DateTime : Mon Jul 18 18:10:53 EDT 2022
% Result : Theorem 0.17s 1.35s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 19 ( 15 unt; 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 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 ?)
% 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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',iokaste_parent_particide_parent_not_patricide) ).
fof(thersandros_not_patricidal,axiom,
~ patricide(thersandros),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thersandros_not_patricidal) ).
fof(polyneikes_thersandros,axiom,
parent_of(polyneikes,thersandros),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',polyneikes_thersandros) ).
fof(iokaste_polyneikes,axiom,
parent_of(iokaste,polyneikes),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',iokaste_polyneikes) ).
fof(oedipus_polyneikes,axiom,
parent_of(oedipus,polyneikes),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',oedipus_polyneikes) ).
fof(oedipus_patricidal,axiom,
patricide(oedipus),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',oedipus_patricidal) ).
fof(iokaste_oedipus,axiom,
parent_of(iokaste,oedipus),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',iokaste_oedipus) ).
fof(c_0_7,negated_conjecture,
~ ? [X1,X2] :
( parent_of(iokaste,X1)
& patricide(X1)
& parent_of(X1,X2)
& ~ patricide(X2) ),
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)],[inference(fof_simplification,[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(X1)
| ~ parent_of(X2,X1)
| ~ patricide(X2)
| ~ parent_of(iokaste,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.02/0.10 % Problem : PUZ128+1 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.10 % Command : run_ET %s %d
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sat May 28 23:59:11 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.17/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.35 # Preprocessing time : 0.008 s
% 0.17/1.35
% 0.17/1.35 # Failure: Out of unprocessed clauses!
% 0.17/1.35 # OLD status GaveUp
% 0.17/1.35 # Parsed axioms : 7
% 0.17/1.35 # Removed by relevancy pruning/SinE : 2
% 0.17/1.35 # Initial clauses : 5
% 0.17/1.35 # Removed in clause preprocessing : 0
% 0.17/1.35 # Initial clauses in saturation : 5
% 0.17/1.35 # Processed clauses : 7
% 0.17/1.35 # ...of these trivial : 0
% 0.17/1.35 # ...subsumed : 0
% 0.17/1.35 # ...remaining for further processing : 7
% 0.17/1.35 # Other redundant clauses eliminated : 0
% 0.17/1.35 # Clauses deleted for lack of memory : 0
% 0.17/1.35 # Backward-subsumed : 0
% 0.17/1.35 # Backward-rewritten : 1
% 0.17/1.35 # Generated clauses : 3
% 0.17/1.35 # ...of the previous two non-trivial : 2
% 0.17/1.35 # Contextual simplify-reflections : 0
% 0.17/1.35 # Paramodulations : 3
% 0.17/1.35 # Factorizations : 0
% 0.17/1.35 # Equation resolutions : 0
% 0.17/1.35 # Current number of processed clauses : 6
% 0.17/1.35 # Positive orientable unit clauses : 5
% 0.17/1.35 # Positive unorientable unit clauses: 0
% 0.17/1.35 # Negative unit clauses : 0
% 0.17/1.35 # Non-unit-clauses : 1
% 0.17/1.35 # Current number of unprocessed clauses: 0
% 0.17/1.35 # ...number of literals in the above : 0
% 0.17/1.35 # Current number of archived formulas : 0
% 0.17/1.35 # Current number of archived clauses : 1
% 0.17/1.35 # Clause-clause subsumption calls (NU) : 0
% 0.17/1.35 # Rec. Clause-clause subsumption calls : 0
% 0.17/1.35 # Non-unit clause-clause subsumptions : 0
% 0.17/1.35 # Unit Clause-clause subsumption calls : 0
% 0.17/1.35 # Rewrite failures with RHS unbound : 0
% 0.17/1.35 # BW rewrite match attempts : 1
% 0.17/1.35 # BW rewrite match successes : 1
% 0.17/1.35 # Condensation attempts : 0
% 0.17/1.35 # Condensation successes : 0
% 0.17/1.35 # Termbank termtop insertions : 230
% 0.17/1.35
% 0.17/1.35 # -------------------------------------------------
% 0.17/1.35 # User time : 0.007 s
% 0.17/1.35 # System time : 0.001 s
% 0.17/1.35 # Total time : 0.008 s
% 0.17/1.35 # Maximum resident set size: 2768 pages
% 0.17/1.35 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.17/1.35 # Preprocessing time : 0.007 s
% 0.17/1.35
% 0.17/1.35 # Proof found!
% 0.17/1.35 # SZS status Theorem
% 0.17/1.35 # SZS output start CNFRefutation
% See solution above
% 0.17/1.35 # Proof object total steps : 19
% 0.17/1.35 # Proof object clause steps : 9
% 0.17/1.35 # Proof object formula steps : 10
% 0.17/1.35 # Proof object conjectures : 6
% 0.17/1.35 # Proof object clause conjectures : 3
% 0.17/1.35 # Proof object formula conjectures : 3
% 0.17/1.35 # Proof object initial clauses used : 7
% 0.17/1.35 # Proof object initial formulas used : 7
% 0.17/1.35 # Proof object generating inferences : 2
% 0.17/1.35 # Proof object simplifying inferences : 7
% 0.17/1.35 # Training examples: 0 positive, 0 negative
% 0.17/1.35 # Parsed axioms : 7
% 0.17/1.35 # Removed by relevancy pruning/SinE : 0
% 0.17/1.35 # Initial clauses : 7
% 0.17/1.35 # Removed in clause preprocessing : 0
% 0.17/1.35 # Initial clauses in saturation : 7
% 0.17/1.35 # Processed clauses : 9
% 0.17/1.35 # ...of these trivial : 0
% 0.17/1.35 # ...subsumed : 0
% 0.17/1.35 # ...remaining for further processing : 8
% 0.17/1.35 # Other redundant clauses eliminated : 0
% 0.17/1.35 # Clauses deleted for lack of memory : 0
% 0.17/1.35 # Backward-subsumed : 0
% 0.17/1.35 # Backward-rewritten : 0
% 0.17/1.35 # Generated clauses : 4
% 0.17/1.35 # ...of the previous two non-trivial : 3
% 0.17/1.35 # Contextual simplify-reflections : 0
% 0.17/1.35 # Paramodulations : 4
% 0.17/1.35 # Factorizations : 0
% 0.17/1.35 # Equation resolutions : 0
% 0.17/1.35 # Current number of processed clauses : 8
% 0.17/1.35 # Positive orientable unit clauses : 5
% 0.17/1.35 # Positive unorientable unit clauses: 0
% 0.17/1.35 # Negative unit clauses : 2
% 0.17/1.35 # Non-unit-clauses : 1
% 0.17/1.35 # Current number of unprocessed clauses: 1
% 0.17/1.35 # ...number of literals in the above : 3
% 0.17/1.35 # Current number of archived formulas : 0
% 0.17/1.35 # Current number of archived clauses : 0
% 0.17/1.35 # Clause-clause subsumption calls (NU) : 0
% 0.17/1.35 # Rec. Clause-clause subsumption calls : 0
% 0.17/1.35 # Non-unit clause-clause subsumptions : 0
% 0.17/1.35 # Unit Clause-clause subsumption calls : 2
% 0.17/1.35 # Rewrite failures with RHS unbound : 0
% 0.17/1.35 # BW rewrite match attempts : 0
% 0.17/1.35 # BW rewrite match successes : 0
% 0.17/1.35 # Condensation attempts : 0
% 0.17/1.35 # Condensation successes : 0
% 0.17/1.35 # Termbank termtop insertions : 267
% 0.17/1.35
% 0.17/1.35 # -------------------------------------------------
% 0.17/1.35 # User time : 0.006 s
% 0.17/1.35 # System time : 0.001 s
% 0.17/1.35 # Total time : 0.008 s
% 0.17/1.35 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------