TSTP Solution File: PUZ002-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PUZ002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:12:12 EDT 2023
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 6 unt; 2 nHn; 32 RR)
% Number of literals : 62 ( 0 equ; 35 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mouse_killers_are_carnivores,axiom,
( carnivore(X1)
| ~ mouse_killer(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',mouse_killers_are_carnivores) ).
cnf(cats_are_mice_killers,axiom,
( mouse_killer(X1)
| ~ cat(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',cats_are_mice_killers) ).
cnf(carnivores_are_prowlers,axiom,
( prowler(X1)
| ~ carnivore(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',carnivores_are_prowlers) ).
cnf(kangaroos_are_not_pets,axiom,
( ~ kangaroo(X1)
| ~ suitable_pet(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',kangaroos_are_not_pets) ).
cnf(gazers_are_suitable_pets,axiom,
( suitable_pet(X1)
| ~ gazer(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',gazers_are_suitable_pets) ).
cnf(prowlers_are_gazers,axiom,
( gazer(X1)
| ~ prowler(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',prowlers_are_gazers) ).
cnf(only_cats_in_house,axiom,
( cat(X1)
| ~ in_house(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',only_cats_in_house) ).
cnf(in_house_if_takes_to_me,axiom,
( in_house(X1)
| ~ takes_to_me(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',in_house_if_takes_to_me) ).
cnf(avoid_kangaroo,negated_conjecture,
~ avoided(the_kangaroo),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',avoid_kangaroo) ).
cnf(avoid_detested,axiom,
( avoided(X1)
| ~ detested(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',avoid_detested) ).
cnf(takes_to_me_or_detested,axiom,
( takes_to_me(X1)
| detested(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',takes_to_me_or_detested) ).
cnf(kangaroo_is_a_kangaroo,axiom,
kangaroo(the_kangaroo),
file('/export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p',kangaroo_is_a_kangaroo) ).
cnf(c_0_12,axiom,
( carnivore(X1)
| ~ mouse_killer(X1) ),
mouse_killers_are_carnivores ).
cnf(c_0_13,axiom,
( mouse_killer(X1)
| ~ cat(X1) ),
cats_are_mice_killers ).
cnf(c_0_14,axiom,
( prowler(X1)
| ~ carnivore(X1) ),
carnivores_are_prowlers ).
cnf(c_0_15,plain,
( carnivore(X1)
| ~ cat(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
( ~ kangaroo(X1)
| ~ suitable_pet(X1) ),
kangaroos_are_not_pets ).
cnf(c_0_17,axiom,
( suitable_pet(X1)
| ~ gazer(X1) ),
gazers_are_suitable_pets ).
cnf(c_0_18,axiom,
( gazer(X1)
| ~ prowler(X1) ),
prowlers_are_gazers ).
cnf(c_0_19,plain,
( prowler(X1)
| ~ cat(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ kangaroo(X1)
| ~ gazer(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( gazer(X1)
| ~ cat(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ kangaroo(X1)
| ~ cat(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,axiom,
( cat(X1)
| ~ in_house(X1) ),
only_cats_in_house ).
cnf(c_0_24,plain,
( ~ kangaroo(X1)
| ~ in_house(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,axiom,
( in_house(X1)
| ~ takes_to_me(X1) ),
in_house_if_takes_to_me ).
cnf(c_0_26,negated_conjecture,
~ avoided(the_kangaroo),
avoid_kangaroo ).
cnf(c_0_27,axiom,
( avoided(X1)
| ~ detested(X1) ),
avoid_detested ).
cnf(c_0_28,plain,
( ~ kangaroo(X1)
| ~ takes_to_me(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,axiom,
( takes_to_me(X1)
| detested(X1) ),
takes_to_me_or_detested ).
cnf(c_0_30,negated_conjecture,
~ detested(the_kangaroo),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( detested(X1)
| ~ kangaroo(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,axiom,
kangaroo(the_kangaroo),
kangaroo_is_a_kangaroo ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : PUZ002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n019.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 19:00:51 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.0vJsmNLshT/E---3.1_12153.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12230 completed with status 0
% 0.14/0.41 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 # Starting sh5l with 136s (1) cores
% 0.14/0.41 # SAT001_MinMin_p005000_rr_RG with pid 12234 completed with status 0
% 0.14/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 12
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 12
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 12
% 0.14/0.41 # Processed clauses : 33
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 0
% 0.14/0.41 # ...remaining for further processing : 33
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 0
% 0.14/0.41 # Generated clauses : 10
% 0.14/0.41 # ...of the previous two non-redundant : 9
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 10
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Total rewrite steps : 1
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 21
% 0.14/0.41 # Positive orientable unit clauses : 1
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 2
% 0.14/0.41 # Non-unit-clauses : 18
% 0.14/0.41 # Current number of unprocessed clauses: 0
% 0.14/0.41 # ...number of literals in the above : 0
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 12
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 49
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 49
% 0.14/0.41 # Non-unit clause-clause subsumptions : 0
% 0.14/0.41 # Unit Clause-clause subsumption calls : 2
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 0
% 0.14/0.41 # BW rewrite match successes : 0
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 328
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.002 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.003 s
% 0.14/0.41 # Maximum resident set size: 1596 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.010 s
% 0.14/0.41 # System time : 0.003 s
% 0.14/0.41 # Total time : 0.013 s
% 0.14/0.41 # Maximum resident set size: 1672 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------