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 v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 17 unt; 10 nHn; 32 RR)
% Number of literals : 62 ( 21 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(killer_hates_victim,axiom,
( hates(X1,X2)
| ~ killed(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',killer_hates_victim) ).
cnf(someone_killed_agatha,axiom,
killed(someone,aunt_agatha),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',someone_killed_agatha) ).
cnf(noone_else_lives_at_mansion,axiom,
( X1 = aunt_agatha
| X1 = butler
| X1 = charles
| ~ lives_at_dreadsbury(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',noone_else_lives_at_mansion) ).
cnf(someone_in_mansion,axiom,
lives_at_dreadsbury(someone),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',someone_in_mansion) ).
cnf(noone_hates_everyone,axiom,
~ hates(X1,every_one_but(X1)),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',noone_hates_everyone) ).
cnf(butler_and_agatha_hate_the_same_people,axiom,
( hates(butler,X1)
| ~ hates(aunt_agatha,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',butler_and_agatha_hate_the_same_people) ).
cnf(killer_poorer_than_victim,axiom,
( ~ killed(X1,X2)
| ~ richer(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',killer_poorer_than_victim) ).
cnf(butler_hates_poor_people,axiom,
( richer(X1,aunt_agatha)
| hates(butler,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',butler_hates_poor_people) ).
cnf(charles_and_agatha_hate_different_people,axiom,
( ~ hates(aunt_agatha,X1)
| ~ hates(charles,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',charles_and_agatha_hate_different_people) ).
cnf(agatha_likes_only_butler,axiom,
( X1 = butler
| hates(aunt_agatha,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',agatha_likes_only_butler) ).
cnf(agatha_is_not_the_butler,axiom,
aunt_agatha != butler,
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',agatha_is_not_the_butler) ).
cnf(prove_agatha_killed_herself,negated_conjecture,
~ killed(aunt_agatha,aunt_agatha),
file('/export/starexec/sandbox/tmp/tmp.lYf5qewenz/E---3.1_11428.p',prove_agatha_killed_herself) ).
cnf(c_0_12,axiom,
( hates(X1,X2)
| ~ killed(X1,X2) ),
killer_hates_victim ).
cnf(c_0_13,axiom,
killed(someone,aunt_agatha),
someone_killed_agatha ).
cnf(c_0_14,axiom,
( X1 = aunt_agatha
| X1 = butler
| X1 = charles
| ~ lives_at_dreadsbury(X1) ),
noone_else_lives_at_mansion ).
cnf(c_0_15,axiom,
lives_at_dreadsbury(someone),
someone_in_mansion ).
cnf(c_0_16,plain,
hates(someone,aunt_agatha),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( someone = charles
| someone = butler
| someone = aunt_agatha ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
~ hates(X1,every_one_but(X1)),
noone_hates_everyone ).
cnf(c_0_19,axiom,
( hates(butler,X1)
| ~ hates(aunt_agatha,X1) ),
butler_and_agatha_hate_the_same_people ).
cnf(c_0_20,axiom,
( ~ killed(X1,X2)
| ~ richer(X1,X2) ),
killer_poorer_than_victim ).
cnf(c_0_21,axiom,
( richer(X1,aunt_agatha)
| hates(butler,X1) ),
butler_hates_poor_people ).
cnf(c_0_22,axiom,
( ~ hates(aunt_agatha,X1)
| ~ hates(charles,X1) ),
charles_and_agatha_hate_different_people ).
cnf(c_0_23,plain,
( someone = aunt_agatha
| someone = butler
| hates(charles,aunt_agatha) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
~ hates(aunt_agatha,every_one_but(butler)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,axiom,
( X1 = butler
| hates(aunt_agatha,X1) ),
agatha_likes_only_butler ).
cnf(c_0_26,plain,
( hates(butler,X1)
| ~ killed(X1,aunt_agatha) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( someone = butler
| someone = aunt_agatha
| ~ hates(aunt_agatha,aunt_agatha) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
aunt_agatha != butler,
agatha_is_not_the_butler ).
cnf(c_0_29,plain,
every_one_but(butler) = butler,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
hates(butler,someone),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_31,plain,
( someone = aunt_agatha
| someone = butler ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28]) ).
cnf(c_0_32,plain,
~ hates(butler,butler),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_33,plain,
someone = aunt_agatha,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
~ killed(aunt_agatha,aunt_agatha),
prove_agatha_killed_herself ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PUZ001-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n031.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 19:32:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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.lYf5qewenz/E---3.1_11428.p
% 0.19/0.47 # Version: 3.1pre001
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11506 completed with status 0
% 0.19/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: FGHSF-FFSS11-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.47 # Starting sh5l with 136s (1) cores
% 0.19/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11512 completed with status 0
% 0.19/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: FGHSF-FFSS11-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Unsatisfiable
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 15
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 15
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 15
% 0.19/0.47 # Processed clauses : 48
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 2
% 0.19/0.47 # ...remaining for further processing : 46
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 6
% 0.19/0.47 # Backward-rewritten : 6
% 0.19/0.47 # Generated clauses : 25
% 0.19/0.47 # ...of the previous two non-redundant : 26
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 22
% 0.19/0.47 # Factorizations : 3
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Total rewrite steps : 9
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 19
% 0.19/0.47 # Positive orientable unit clauses : 6
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 5
% 0.19/0.47 # Non-unit-clauses : 8
% 0.19/0.47 # Current number of unprocessed clauses: 6
% 0.19/0.47 # ...number of literals in the above : 15
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 27
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 23
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 22
% 0.19/0.47 # Non-unit clause-clause subsumptions : 6
% 0.19/0.47 # Unit Clause-clause subsumption calls : 2
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 2
% 0.19/0.47 # BW rewrite match successes : 2
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 407
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.003 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.005 s
% 0.19/0.47 # Maximum resident set size: 1652 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.012 s
% 0.19/0.47 # System time : 0.007 s
% 0.19/0.47 # Total time : 0.019 s
% 0.19/0.47 # Maximum resident set size: 1680 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------