TSTP Solution File: PUZ130_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ130_1 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : 300s
% DateTime : Tue May 21 02:25:15 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 17
% Syntax : Number of formulae : 27 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 19 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 7 ( 0 sgn 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
cat: $tType ).
tff(decl_sort2,type,
animal: $tType ).
tff(decl_sort3,type,
dog: $tType ).
tff(decl_sort4,type,
human: $tType ).
tff(decl_22,type,
cat_to_animal: cat > animal ).
tff(decl_23,type,
dog_to_animal: dog > animal ).
tff(decl_24,type,
garfield: cat ).
tff(decl_25,type,
odie: dog ).
tff(decl_26,type,
jon: human ).
tff(decl_27,type,
owner_of: animal > human ).
tff(decl_28,type,
chased: ( dog * cat ) > $o ).
tff(decl_29,type,
hates: ( human * human ) > $o ).
tff(dog_chase_cat,axiom,
! [X3: cat,X4: dog] :
( chased(X4,X3)
=> hates(owner_of(cat_to_animal(X3)),owner_of(dog_to_animal(X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dog_chase_cat) ).
tff(jon_hates_jon,conjecture,
hates(jon,jon),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_hates_jon) ).
tff(jon_owns_odie,axiom,
jon = owner_of(dog_to_animal(odie)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_owns_odie) ).
tff(jon_owns_garfield,axiom,
jon = owner_of(cat_to_animal(garfield)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_owns_garfield) ).
tff(odie_chased_garfield,axiom,
chased(odie,garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odie_chased_garfield) ).
tff(c_0_5,plain,
! [X5: cat,X6: dog] :
( ~ chased(X6,X5)
| hates(owner_of(cat_to_animal(X5)),owner_of(dog_to_animal(X6))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dog_chase_cat])])]) ).
tff(c_0_6,negated_conjecture,
~ hates(jon,jon),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[jon_hates_jon])]) ).
tcf(c_0_7,plain,
! [X4: dog,X3: cat] :
( hates(owner_of(cat_to_animal(X3)),owner_of(dog_to_animal(X4)))
| ~ chased(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_8,plain,
jon = owner_of(dog_to_animal(odie)),
inference(split_conjunct,[status(thm)],[jon_owns_odie]) ).
tff(c_0_9,negated_conjecture,
~ hates(jon,jon),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X3: cat] :
( hates(owner_of(cat_to_animal(X3)),jon)
| ~ chased(odie,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
tcf(c_0_11,plain,
jon = owner_of(cat_to_animal(garfield)),
inference(split_conjunct,[status(thm)],[jon_owns_garfield]) ).
tcf(c_0_12,plain,
chased(odie,garfield),
inference(split_conjunct,[status(thm)],[odie_chased_garfield]) ).
tcf(c_0_13,negated_conjecture,
~ hates(jon,jon),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PUZ130_1 : TPTP v8.2.0. Released v5.5.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.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 : 300
% 0.13/0.34 % DateTime : Sat May 18 10:58:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 12490 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGUSF-FFSS11-SFFFFFNN
% 0.19/0.48 # partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 12494 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGUSF-FFSS11-SFFFFFNN
% 0.19/0.48 # partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 19
% 0.19/0.48 # Removed by relevancy pruning/SinE : 12
% 0.19/0.48 # Initial clauses : 7
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 7
% 0.19/0.48 # Processed clauses : 15
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 15
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 3
% 0.19/0.48 # ...of the previous two non-redundant : 2
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 3
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 1
% 0.19/0.48 # ...of those cached : 0
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 8
% 0.19/0.48 # Positive orientable unit clauses : 4
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 3
% 0.19/0.48 # Current number of unprocessed clauses: 1
% 0.19/0.48 # ...number of literals in the above : 2
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 7
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 368
% 0.19/0.48 # Search garbage collected termcells : 26
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.004 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.005 s
% 0.19/0.48 # Maximum resident set size: 1772 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1720 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------