TSTP Solution File: PUZ128+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ128+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 36 ( 21 unt; 0 def)
% Number of atoms : 149 ( 45 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 187 ( 74 ~; 65 |; 48 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-4 aty)
% Number of variables : 47 ( 0 sgn 5 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove,conjecture,
? [X1,X2,X3,X4] :
( parent(X1)
& patricide(X2)
& parent(X3)
& $true
& ~ ? [X5] :
( patricide(X5)
& X4 = X5 )
& relation(X3,of,X4)
& X2 = X3
& relation(X1,of,X2)
& 'Iokaste' = X1 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove) ).
fof(background,axiom,
? [X1,X2,X3,X4,X5] :
( parent(X1)
& relation(X1,of,'Oedipus')
& 'Iokaste' = X1
& parent(X2)
& relation(X2,of,'Polyneikes')
& 'Iokaste' = X2
& parent(X3)
& relation(X3,of,'Polyneikes')
& 'Oedipus' = X3
& parent(X4)
& relation(X4,of,'Thersandros')
& 'Polyneikes' = X4
& patricide(X5)
& 'Oedipus' = X5
& ~ ? [X6] :
( patricide(X6)
& 'Thersandros' = X6 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',background) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2,X3,X4] :
( parent(X1)
& patricide(X2)
& parent(X3)
& $true
& ~ ? [X5] :
( patricide(X5)
& X4 = X5 )
& relation(X3,of,X4)
& X2 = X3
& relation(X1,of,X2)
& 'Iokaste' = X1 ),
inference(assume_negation,[status(cth)],[prove]) ).
fof(c_0_3,negated_conjecture,
! [X6,X7,X8,X9] :
( ( patricide(esk6_4(X6,X7,X8,X9))
| ~ parent(X6)
| ~ patricide(X7)
| ~ parent(X8)
| ~ relation(X8,of,X9)
| X7 != X8
| ~ relation(X6,of,X7)
| 'Iokaste' != X6 )
& ( X9 = esk6_4(X6,X7,X8,X9)
| ~ parent(X6)
| ~ patricide(X7)
| ~ parent(X8)
| ~ relation(X8,of,X9)
| X7 != X8
| ~ relation(X6,of,X7)
| 'Iokaste' != X6 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])])])]) ).
fof(c_0_4,plain,
! [X12] :
( parent(esk1_0)
& relation(esk1_0,of,'Oedipus')
& 'Iokaste' = esk1_0
& parent(esk2_0)
& relation(esk2_0,of,'Polyneikes')
& 'Iokaste' = esk2_0
& parent(esk3_0)
& relation(esk3_0,of,'Polyneikes')
& 'Oedipus' = esk3_0
& parent(esk4_0)
& relation(esk4_0,of,'Thersandros')
& 'Polyneikes' = esk4_0
& patricide(esk5_0)
& 'Oedipus' = esk5_0
& ( ~ patricide(X12)
| 'Thersandros' != X12 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[background])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( patricide(esk6_4(X1,X2,X3,X4))
| 'Iokaste' != X1
| ~ relation(X1,of,X2)
| X2 != X3
| ~ relation(X3,of,X4)
| ~ parent(X3)
| ~ patricide(X2)
| ~ parent(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( X4 = esk6_4(X1,X2,X3,X4)
| 'Iokaste' != X1
| ~ relation(X1,of,X2)
| X2 != X3
| ~ relation(X3,of,X4)
| ~ parent(X3)
| ~ patricide(X2)
| ~ parent(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
'Oedipus' = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
'Oedipus' = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( patricide(esk6_4(X1,X2,X2,X3))
| 'Iokaste' != X1
| ~ patricide(X2)
| ~ relation(X2,of,X3)
| ~ relation(X1,of,X2)
| ~ parent(X2)
| ~ parent(X1) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( esk6_4(X1,X2,X2,X3) = X3
| 'Iokaste' != X1
| ~ patricide(X2)
| ~ relation(X2,of,X3)
| ~ relation(X1,of,X2)
| ~ parent(X2)
| ~ parent(X1) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
relation(esk3_0,of,'Polyneikes'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
'Polyneikes' = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
patricide(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
esk5_0 = esk3_0,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
( 'Thersandros' != X1
| ~ patricide(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( patricide(X1)
| 'Iokaste' != X2
| ~ patricide(X3)
| ~ relation(X3,of,X1)
| ~ relation(X2,of,X3)
| ~ parent(X3)
| ~ parent(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,plain,
relation(esk3_0,of,esk4_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
patricide(esk3_0),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
parent(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,plain,
relation(esk1_0,of,'Oedipus'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,plain,
'Iokaste' = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,plain,
parent(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( esk6_4(X1,X2,X2,X3) != 'Thersandros'
| 'Iokaste' != X1
| ~ patricide(X2)
| ~ relation(X2,of,X3)
| ~ relation(X1,of,X2)
| ~ parent(X2)
| ~ parent(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( patricide(esk4_0)
| 'Iokaste' != X1
| ~ relation(X1,of,esk3_0)
| ~ parent(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_25,plain,
relation('Iokaste',of,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_8]) ).
cnf(c_0_26,plain,
parent('Iokaste'),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( X1 != 'Thersandros'
| 'Iokaste' != X2
| ~ patricide(X3)
| ~ relation(X3,of,X1)
| ~ relation(X2,of,X3)
| ~ parent(X3)
| ~ parent(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_28,plain,
relation(esk4_0,of,'Thersandros'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_29,plain,
parent(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_30,negated_conjecture,
patricide(esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,plain,
relation(esk2_0,of,'Polyneikes'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_32,plain,
'Iokaste' = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_33,negated_conjecture,
( 'Iokaste' != X1
| ~ relation(X1,of,esk4_0)
| ~ parent(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30])]) ).
cnf(c_0_34,plain,
relation('Iokaste',of,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_12]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ128+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat May 28 21:21:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.013 s
% 0.24/1.41
% 0.24/1.41 # Failure: Out of unprocessed clauses!
% 0.24/1.41 # OLD status GaveUp
% 0.24/1.41 # Parsed axioms : 2
% 0.24/1.41 # Removed by relevancy pruning/SinE : 1
% 0.24/1.41 # Initial clauses : 2
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 2
% 0.24/1.41 # Processed clauses : 5
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 0
% 0.24/1.41 # ...remaining for further processing : 5
% 0.24/1.41 # Other redundant clauses eliminated : 2
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 3
% 0.24/1.41 # ...of the previous two non-trivial : 3
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 1
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 2
% 0.24/1.41 # Current number of processed clauses : 3
% 0.24/1.41 # Positive orientable unit clauses : 0
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 0
% 0.24/1.41 # Non-unit-clauses : 3
% 0.24/1.41 # Current number of unprocessed clauses: 0
% 0.24/1.41 # ...number of literals in the above : 0
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 2
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 1
% 0.24/1.41 # Non-unit clause-clause subsumptions : 0
% 0.24/1.41 # Unit Clause-clause subsumption calls : 0
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 473
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.014 s
% 0.24/1.41 # System time : 0.000 s
% 0.24/1.41 # Total time : 0.014 s
% 0.24/1.41 # Maximum resident set size: 2772 pages
% 0.24/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.41 # Preprocessing time : 0.014 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 36
% 0.24/1.41 # Proof object clause steps : 31
% 0.24/1.41 # Proof object formula steps : 5
% 0.24/1.41 # Proof object conjectures : 14
% 0.24/1.41 # Proof object clause conjectures : 11
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 16
% 0.24/1.41 # Proof object initial formulas used : 2
% 0.24/1.41 # Proof object generating inferences : 7
% 0.24/1.41 # Proof object simplifying inferences : 21
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 2
% 0.24/1.41 # Removed by relevancy pruning/SinE : 0
% 0.24/1.41 # Initial clauses : 17
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 17
% 0.24/1.41 # Processed clauses : 29
% 0.24/1.41 # ...of these trivial : 1
% 0.24/1.41 # ...subsumed : 1
% 0.24/1.41 # ...remaining for further processing : 27
% 0.24/1.41 # Other redundant clauses eliminated : 2
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 2
% 0.24/1.41 # Generated clauses : 19
% 0.24/1.41 # ...of the previous two non-trivial : 18
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 17
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 2
% 0.24/1.41 # Current number of processed clauses : 23
% 0.24/1.41 # Positive orientable unit clauses : 14
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 2
% 0.24/1.41 # Non-unit-clauses : 7
% 0.24/1.41 # Current number of unprocessed clauses: 5
% 0.24/1.41 # ...number of literals in the above : 21
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 2
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 51
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 14
% 0.24/1.41 # Non-unit clause-clause subsumptions : 0
% 0.24/1.41 # Unit Clause-clause subsumption calls : 8
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 3
% 0.24/1.41 # BW rewrite match successes : 2
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 1067
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.013 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.015 s
% 0.24/1.41 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------