TSTP Solution File: PUZ001+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : PUZ001+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:11:11 EDT 2023
% Result : Theorem 0.23s 0.51s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 37 ( 18 unt; 0 def)
% Number of atoms : 147 ( 44 equ)
% Maximal formula atoms : 37 ( 3 avg)
% Number of connectives : 162 ( 52 ~; 41 |; 53 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 114 ( 15 sgn; 48 !; 30 ?)
% 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/sandbox/tmp/tmp.gyo2mKYBpc/E---3.1_9575.p',background) ).
fof(prove,conjecture,
? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
file('/export/starexec/sandbox/tmp/tmp.gyo2mKYBpc/E---3.1_9575.p',prove) ).
fof(c_0_2,plain,
? [X1,X2,X3] :
( predicate1(X2,live,X1)
& modifier_pp(X2,in,'DreadburyMansion')
& predicate2(X3,kill,X1,'AuntAgatha')
& ! [X4,X5] :
( ( predicate1(X5,live,X4)
& modifier_pp(X5,in,'DreadburyMansion') )
=> ( X4 = 'AuntAgatha'
| X4 = 'Butler'
| X4 = 'Charles' ) )
& ! [X6,X7,X8] :
( predicate2(X8,kill,X6,X7)
=> ? [X9] : predicate2(X9,hate,X6,X7) )
& ! [X10] :
~ ? [X11,X12,X13] :
( predicate2(X12,kill,X10,X11)
& property2(X13,rich,comp_than,X11)
& X10 = X13 )
& ! [X14,X15] :
( predicate2(X15,hate,'AuntAgatha',X14)
=> ~ ? [X16] : predicate2(X16,hate,'Charles',X14) )
& ~ ? [X17] : predicate2(X17,hate,'AuntAgatha','Butler')
& ! [X18] :
( X18 != 'Butler'
=> ? [X19] : predicate2(X19,hate,'AuntAgatha',X18) )
& ! [X20] :
( ~ ? [X21] :
( property2(X21,rich,comp_than,'AuntAgatha')
& X20 = X21 )
=> ? [X22] : predicate2(X22,hate,'Butler',X20) )
& ! [X23,X24] :
( predicate2(X24,hate,'AuntAgatha',X23)
=> ? [X25] : predicate2(X25,hate,'Butler',X23) )
& ! [X26] :
~ ! [X27] :
? [X28] : predicate2(X28,hate,X26,X27)
& 'AuntAgatha' != 'Butler' ),
inference(fof_simplification,[status(thm)],[background]) ).
fof(c_0_3,plain,
! [X33,X34,X35,X36,X37,X39,X40,X41,X42,X43,X44,X45,X46,X47,X49,X52,X53,X55,X57] :
( predicate1(esk2_0,live,esk1_0)
& modifier_pp(esk2_0,in,'DreadburyMansion')
& predicate2(esk3_0,kill,esk1_0,'AuntAgatha')
& ( ~ predicate1(X34,live,X33)
| ~ modifier_pp(X34,in,'DreadburyMansion')
| X33 = 'AuntAgatha'
| X33 = 'Butler'
| X33 = 'Charles' )
& ( ~ predicate2(X37,kill,X35,X36)
| predicate2(esk4_3(X35,X36,X37),hate,X35,X36) )
& ( ~ predicate2(X41,kill,X39,X40)
| ~ property2(X42,rich,comp_than,X40)
| X39 != X42 )
& ( ~ predicate2(X44,hate,'AuntAgatha',X43)
| ~ predicate2(X45,hate,'Charles',X43) )
& ~ predicate2(X46,hate,'AuntAgatha','Butler')
& ( X47 = 'Butler'
| predicate2(esk5_1(X47),hate,'AuntAgatha',X47) )
& ( property2(esk6_1(X49),rich,comp_than,'AuntAgatha')
| predicate2(esk7_1(X49),hate,'Butler',X49) )
& ( X49 = esk6_1(X49)
| predicate2(esk7_1(X49),hate,'Butler',X49) )
& ( ~ predicate2(X53,hate,'AuntAgatha',X52)
| predicate2(esk8_2(X52,X53),hate,'Butler',X52) )
& ~ predicate2(X57,hate,X55,esk9_1(X55))
& 'AuntAgatha' != 'Butler' ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_4,plain,
~ predicate2(X1,hate,X2,esk9_1(X2)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
( predicate2(esk8_2(X2,X1),hate,'Butler',X2)
| ~ predicate2(X1,hate,'AuntAgatha',X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
~ predicate2(X1,hate,'AuntAgatha',esk9_1('Butler')),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( X1 = 'Butler'
| predicate2(esk5_1(X1),hate,'AuntAgatha',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| ~ predicate2(X3,hate,'Charles',X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( predicate2(esk4_3(X2,X3,X1),hate,X2,X3)
| ~ predicate2(X1,kill,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,plain,
( X2 = 'AuntAgatha'
| X2 = 'Butler'
| X2 = 'Charles'
| ~ predicate1(X1,live,X2)
| ~ modifier_pp(X1,in,'DreadburyMansion') ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
modifier_pp(esk2_0,in,'DreadburyMansion'),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,plain,
( X1 = esk6_1(X1)
| predicate2(esk7_1(X1),hate,'Butler',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,plain,
esk9_1('Butler') = 'Butler',
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_14,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| ~ predicate2(X3,kill,'Charles',X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
( X1 = 'AuntAgatha'
| X1 = 'Butler'
| X1 = 'Charles'
| ~ predicate1(esk2_0,live,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
predicate1(esk2_0,live,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,plain,
( ~ predicate2(X1,kill,X2,X3)
| ~ property2(X4,rich,comp_than,X3)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,plain,
( property2(esk6_1(X1),rich,comp_than,'AuntAgatha')
| predicate2(esk7_1(X1),hate,'Butler',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,plain,
esk6_1('Butler') = 'Butler',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_13]),c_0_13]) ).
cnf(c_0_20,plain,
~ predicate2(X1,hate,'Butler','Butler'),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_21,plain,
( X1 = 'Butler'
| ~ predicate2(X2,kill,'Charles',X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_22,plain,
( 'Charles' = esk1_0
| 'Butler' = esk1_0
| 'AuntAgatha' = esk1_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ property2(X1,rich,comp_than,X2)
| ~ predicate2(X3,kill,X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
property2('Butler',rich,comp_than,'AuntAgatha'),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
( 'AuntAgatha' = esk1_0
| 'Butler' = esk1_0
| X1 = 'Butler'
| ~ predicate2(X2,kill,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
predicate2(esk3_0,kill,esk1_0,'AuntAgatha'),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_27,plain,
'AuntAgatha' != 'Butler',
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_28,negated_conjecture,
~ ? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
inference(assume_negation,[status(cth)],[prove]) ).
cnf(c_0_29,plain,
~ predicate2(X1,kill,'Butler','AuntAgatha'),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( 'Butler' = esk1_0
| 'AuntAgatha' = esk1_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
fof(c_0_31,negated_conjecture,
! [X29] : ~ predicate2(X29,kill,'AuntAgatha','AuntAgatha'),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
cnf(c_0_32,plain,
( 'AuntAgatha' = esk1_0
| ~ predicate2(X1,kill,esk1_0,'AuntAgatha') ),
inference(spm,[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,
'AuntAgatha' = esk1_0,
inference(spm,[status(thm)],[c_0_32,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
~ predicate2(X1,kill,esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : PUZ001+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n029.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 19:14:37 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.49 Running first-order theorem proving
% 0.23/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.gyo2mKYBpc/E---3.1_9575.p
% 0.23/0.51 # Version: 3.1pre001
% 0.23/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.51 # Starting sh5l with 300s (1) cores
% 0.23/0.51 # sh5l with pid 9727 completed with status 0
% 0.23/0.51 # Result found by sh5l
% 0.23/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.51 # Starting sh5l with 300s (1) cores
% 0.23/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.51 # Search class: FGHSF-FFSS31-SFFFFFNN
% 0.23/0.51 # partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.23/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 148s (1) cores
% 0.23/0.51 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 9730 completed with status 0
% 0.23/0.51 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.23/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.51 # Starting sh5l with 300s (1) cores
% 0.23/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.51 # Search class: FGHSF-FFSS31-SFFFFFNN
% 0.23/0.51 # partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.23/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 148s (1) cores
% 0.23/0.51 # Preprocessing time : 0.001 s
% 0.23/0.51
% 0.23/0.51 # Proof found!
% 0.23/0.51 # SZS status Theorem
% 0.23/0.51 # SZS output start CNFRefutation
% See solution above
% 0.23/0.51 # Parsed axioms : 2
% 0.23/0.51 # Removed by relevancy pruning/SinE : 0
% 0.23/0.51 # Initial clauses : 15
% 0.23/0.51 # Removed in clause preprocessing : 0
% 0.23/0.51 # Initial clauses in saturation : 15
% 0.23/0.51 # Processed clauses : 56
% 0.23/0.51 # ...of these trivial : 1
% 0.23/0.51 # ...subsumed : 8
% 0.23/0.51 # ...remaining for further processing : 46
% 0.23/0.51 # Other redundant clauses eliminated : 1
% 0.23/0.51 # Clauses deleted for lack of memory : 0
% 0.23/0.51 # Backward-subsumed : 2
% 0.23/0.51 # Backward-rewritten : 23
% 0.23/0.51 # Generated clauses : 48
% 0.23/0.51 # ...of the previous two non-redundant : 65
% 0.23/0.51 # ...aggressively subsumed : 0
% 0.23/0.51 # Contextual simplify-reflections : 0
% 0.23/0.51 # Paramodulations : 47
% 0.23/0.51 # Factorizations : 0
% 0.23/0.51 # NegExts : 0
% 0.23/0.51 # Equation resolutions : 1
% 0.23/0.51 # Total rewrite steps : 30
% 0.23/0.51 # Propositional unsat checks : 0
% 0.23/0.51 # Propositional check models : 0
% 0.23/0.51 # Propositional check unsatisfiable : 0
% 0.23/0.51 # Propositional clauses : 0
% 0.23/0.51 # Propositional clauses after purity: 0
% 0.23/0.51 # Propositional unsat core size : 0
% 0.23/0.51 # Propositional preprocessing time : 0.000
% 0.23/0.51 # Propositional encoding time : 0.000
% 0.23/0.51 # Propositional solver time : 0.000
% 0.23/0.51 # Success case prop preproc time : 0.000
% 0.23/0.51 # Success case prop encoding time : 0.000
% 0.23/0.51 # Success case prop solver time : 0.000
% 0.23/0.51 # Current number of processed clauses : 20
% 0.23/0.51 # Positive orientable unit clauses : 6
% 0.23/0.51 # Positive unorientable unit clauses: 0
% 0.23/0.51 # Negative unit clauses : 9
% 0.23/0.51 # Non-unit-clauses : 5
% 0.23/0.51 # Current number of unprocessed clauses: 21
% 0.23/0.51 # ...number of literals in the above : 53
% 0.23/0.51 # Current number of archived formulas : 0
% 0.23/0.51 # Current number of archived clauses : 25
% 0.23/0.51 # Clause-clause subsumption calls (NU) : 20
% 0.23/0.51 # Rec. Clause-clause subsumption calls : 16
% 0.23/0.51 # Non-unit clause-clause subsumptions : 3
% 0.23/0.51 # Unit Clause-clause subsumption calls : 51
% 0.23/0.51 # Rewrite failures with RHS unbound : 0
% 0.23/0.51 # BW rewrite match attempts : 2
% 0.23/0.51 # BW rewrite match successes : 2
% 0.23/0.51 # Condensation attempts : 0
% 0.23/0.51 # Condensation successes : 0
% 0.23/0.51 # Termbank termtop insertions : 1530
% 0.23/0.51
% 0.23/0.51 # -------------------------------------------------
% 0.23/0.51 # User time : 0.002 s
% 0.23/0.51 # System time : 0.006 s
% 0.23/0.51 # Total time : 0.008 s
% 0.23/0.51 # Maximum resident set size: 1896 pages
% 0.23/0.51
% 0.23/0.51 # -------------------------------------------------
% 0.23/0.51 # User time : 0.003 s
% 0.23/0.51 # System time : 0.008 s
% 0.23/0.51 # Total time : 0.011 s
% 0.23/0.51 # Maximum resident set size: 1712 pages
% 0.23/0.51 % E---3.1 exiting
% 0.23/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------