TSTP Solution File: PUZ001+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Mon Jul 18 18:10:40 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 35 ( 17 unt; 0 def)
% Number of atoms : 121 ( 38 equ)
% Maximal formula atoms : 37 ( 3 avg)
% Number of connectives : 126 ( 40 ~; 39 |; 37 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-2 aty)
% Number of variables : 81 ( 12 sgn 34 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(background,axiom,
? [X1,X2,X3] :
( $true
& predicate1(X2,live,X1)
& modifier_pp(X2,in,'DreadburyMansion')
& predicate2(X3,kill,X1,'AuntAgatha')
& ! [X4,X5] :
( ( $true
& predicate1(X5,live,X4)
& modifier_pp(X5,in,'DreadburyMansion') )
=> ( X4 = 'AuntAgatha'
| X4 = 'Butler'
| X4 = 'Charles' ) )
& ! [X6] :
( $true
=> ! [X7,X8] :
( ( $true
& predicate2(X8,kill,X6,X7) )
=> ? [X9] : predicate2(X9,hate,X6,X7) ) )
& ! [X10] :
( $true
=> ~ ? [X11,X12,X13] :
( $true
& predicate2(X12,kill,X10,X11)
& property2(X13,rich,comp_than,X11)
& X10 = X13 ) )
& ! [X14,X15] :
( ( $true
& predicate2(X15,hate,'AuntAgatha',X14) )
=> ~ ? [X16] : predicate2(X16,hate,'Charles',X14) )
& ~ ? [X17] : predicate2(X17,hate,'AuntAgatha','Butler')
& ! [X18] :
( ( $true
& X18 != 'Butler' )
=> ? [X19] : predicate2(X19,hate,'AuntAgatha',X18) )
& ! [X20] :
( ( $true
& ~ ? [X21] :
( property2(X21,rich,comp_than,'AuntAgatha')
& X20 = X21 ) )
=> ? [X22] : predicate2(X22,hate,'Butler',X20) )
& ! [X23,X24] :
( ( $true
& predicate2(X24,hate,'AuntAgatha',X23) )
=> ? [X25] : predicate2(X25,hate,'Butler',X23) )
& ! [X26] :
( $true
=> ~ ! [X27] :
( $true
=> ? [X28] : predicate2(X28,hate,X26,X27) ) )
& 'AuntAgatha' != 'Butler' ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',background) ).
fof(prove,conjecture,
? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove) ).
fof(c_0_2,plain,
! [X32,X33,X34,X35,X36,X38,X39,X40,X41,X42,X43,X44,X45,X46,X48,X51,X52,X54,X56] :
( predicate1(esk2_0,live,esk1_0)
& modifier_pp(esk2_0,in,'DreadburyMansion')
& predicate2(esk3_0,kill,esk1_0,'AuntAgatha')
& ( ~ predicate1(X33,live,X32)
| ~ modifier_pp(X33,in,'DreadburyMansion')
| X32 = 'AuntAgatha'
| X32 = 'Butler'
| X32 = 'Charles' )
& ( ~ predicate2(X36,kill,X34,X35)
| predicate2(esk4_2(X34,X35),hate,X34,X35) )
& ( ~ predicate2(X40,kill,X38,X39)
| ~ property2(X41,rich,comp_than,X39)
| X38 != X41 )
& ( ~ predicate2(X43,hate,'AuntAgatha',X42)
| ~ predicate2(X44,hate,'Charles',X42) )
& ~ predicate2(X45,hate,'AuntAgatha','Butler')
& ( X46 = 'Butler'
| predicate2(esk5_1(X46),hate,'AuntAgatha',X46) )
& ( property2(esk6_1(X48),rich,comp_than,'AuntAgatha')
| predicate2(esk7_1(X48),hate,'Butler',X48) )
& ( X48 = esk6_1(X48)
| predicate2(esk7_1(X48),hate,'Butler',X48) )
& ( ~ predicate2(X52,hate,'AuntAgatha',X51)
| predicate2(esk8_1(X51),hate,'Butler',X51) )
& ~ predicate2(X56,hate,X54,esk9_1(X54))
& 'AuntAgatha' != 'Butler' ),
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)],[background])])])])])])])]) ).
cnf(c_0_3,plain,
( X1 = 'Charles'
| X1 = 'Butler'
| X1 = 'AuntAgatha'
| ~ modifier_pp(X2,in,'DreadburyMansion')
| ~ predicate1(X2,live,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
modifier_pp(esk2_0,in,'DreadburyMansion'),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,plain,
( ~ predicate2(X1,hate,'Charles',X2)
| ~ predicate2(X3,hate,'AuntAgatha',X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,plain,
( predicate2(esk5_1(X1),hate,'AuntAgatha',X1)
| X1 = 'Butler' ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,plain,
( X1 = 'AuntAgatha'
| X1 = 'Butler'
| X1 = 'Charles'
| ~ predicate1(esk2_0,live,X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_8,plain,
predicate1(esk2_0,live,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,plain,
~ predicate2(X1,hate,X2,esk9_1(X2)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,plain,
( predicate2(esk7_1(X1),hate,'Butler',X1)
| X1 = esk6_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,plain,
( X1 = 'Butler'
| ~ predicate2(X2,hate,'Charles',X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_12,plain,
( 'Charles' = esk1_0
| esk1_0 = 'Butler'
| esk1_0 = 'AuntAgatha' ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( predicate2(esk4_2(X1,X2),hate,X1,X2)
| ~ predicate2(X3,kill,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,plain,
predicate2(esk3_0,kill,esk1_0,'AuntAgatha'),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,plain,
( X1 != X2
| ~ property2(X2,rich,comp_than,X3)
| ~ predicate2(X4,kill,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,plain,
( predicate2(esk7_1(X1),hate,'Butler',X1)
| property2(esk6_1(X1),rich,comp_than,'AuntAgatha') ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,plain,
esk6_1(esk9_1('Butler')) = esk9_1('Butler'),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_18,plain,
( predicate2(esk8_1(X1),hate,'Butler',X1)
| ~ predicate2(X2,hate,'AuntAgatha',X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,plain,
( esk1_0 = 'AuntAgatha'
| esk1_0 = 'Butler'
| X1 = 'Butler'
| ~ predicate2(X2,hate,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,plain,
predicate2(esk4_2(esk1_0,'AuntAgatha'),hate,esk1_0,'AuntAgatha'),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
'AuntAgatha' != 'Butler',
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_22,plain,
( ~ property2(X1,rich,comp_than,X2)
| ~ predicate2(X3,kill,X1,X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
property2(esk9_1('Butler'),rich,comp_than,'AuntAgatha'),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_16]),c_0_17]) ).
cnf(c_0_24,plain,
( X1 = 'Butler'
| predicate2(esk8_1(X1),hate,'Butler',X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_6]) ).
cnf(c_0_25,plain,
( esk1_0 = 'Butler'
| esk1_0 = 'AuntAgatha' ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
~ predicate2(X1,kill,esk9_1('Butler'),'AuntAgatha'),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
esk9_1('Butler') = 'Butler',
inference(spm,[status(thm)],[c_0_9,c_0_24]) ).
fof(c_0_28,negated_conjecture,
~ ? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
inference(assume_negation,[status(cth)],[prove]) ).
cnf(c_0_29,plain,
( esk1_0 = 'AuntAgatha'
| predicate2(esk3_0,kill,'Butler','AuntAgatha') ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_30,plain,
~ predicate2(X1,kill,'Butler','AuntAgatha'),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,negated_conjecture,
! [X2] : ~ predicate2(X2,kill,'AuntAgatha','AuntAgatha'),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
cnf(c_0_32,plain,
esk1_0 = 'AuntAgatha',
inference(sr,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun May 29 00:39:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.014 s
% 0.23/1.40
% 0.23/1.40 # Failure: Out of unprocessed clauses!
% 0.23/1.40 # OLD status GaveUp
% 0.23/1.40 # Parsed axioms : 2
% 0.23/1.40 # Removed by relevancy pruning/SinE : 1
% 0.23/1.40 # Initial clauses : 1
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 1
% 0.23/1.40 # Processed clauses : 1
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 0
% 0.23/1.40 # ...remaining for further processing : 1
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 0
% 0.23/1.40 # ...of the previous two non-trivial : 0
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 0
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 1
% 0.23/1.40 # Positive orientable unit clauses : 0
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 1
% 0.23/1.40 # Non-unit-clauses : 0
% 0.23/1.40 # Current number of unprocessed clauses: 0
% 0.23/1.40 # ...number of literals in the above : 0
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 0
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.40 # Non-unit clause-clause subsumptions : 0
% 0.23/1.40 # Unit Clause-clause subsumption calls : 0
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 0
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 222
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.012 s
% 0.23/1.40 # System time : 0.002 s
% 0.23/1.40 # Total time : 0.014 s
% 0.23/1.40 # Maximum resident set size: 2796 pages
% 0.23/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.40 # Preprocessing time : 0.014 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 35
% 0.23/1.40 # Proof object clause steps : 30
% 0.23/1.40 # Proof object formula steps : 5
% 0.23/1.40 # Proof object conjectures : 4
% 0.23/1.40 # Proof object clause conjectures : 1
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 14
% 0.23/1.40 # Proof object initial formulas used : 2
% 0.23/1.40 # Proof object generating inferences : 12
% 0.23/1.40 # Proof object simplifying inferences : 7
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 2
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 15
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 15
% 0.23/1.40 # Processed clauses : 39
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 3
% 0.23/1.40 # ...remaining for further processing : 36
% 0.23/1.40 # Other redundant clauses eliminated : 1
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 2
% 0.23/1.40 # Backward-rewritten : 9
% 0.23/1.40 # Generated clauses : 26
% 0.23/1.40 # ...of the previous two non-trivial : 29
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 23
% 0.23/1.40 # Factorizations : 1
% 0.23/1.40 # Equation resolutions : 1
% 0.23/1.40 # Current number of processed clauses : 23
% 0.23/1.40 # Positive orientable unit clauses : 6
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 5
% 0.23/1.40 # Non-unit-clauses : 12
% 0.23/1.40 # Current number of unprocessed clauses: 4
% 0.23/1.40 # ...number of literals in the above : 5
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 12
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 18
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 14
% 0.23/1.40 # Non-unit clause-clause subsumptions : 2
% 0.23/1.40 # Unit Clause-clause subsumption calls : 15
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 2
% 0.23/1.40 # BW rewrite match successes : 2
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 1605
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.013 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.016 s
% 0.23/1.40 # Maximum resident set size: 2932 pages
%------------------------------------------------------------------------------