TSTP Solution File: PUZ130+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PUZ130+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:13:06 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 20 unt; 0 def)
% Number of atoms : 63 ( 6 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 53 ( 23 ~; 21 |; 3 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 19 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dog_pet_type,axiom,
! [X1] :
( dog(X1)
=> pet(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',dog_pet_type) ).
fof(owner_def,axiom,
! [X2,X3] :
( ( human(X2)
& pet(X3) )
=> ( owner(X2,X3)
<=> X2 = owner_of(X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',owner_def) ).
fof(odie_type,axiom,
dog(odie),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',odie_type) ).
fof(cat_pet_type,axiom,
! [X1] :
( cat(X1)
=> pet(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',cat_pet_type) ).
fof(cat_chase_axiom,axiom,
! [X2,X3] :
( ( cat(X2)
& dog(X3) )
=> ( chased(X3,X2)
=> hates(owner_of(X2),owner_of(X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',cat_chase_axiom) ).
fof(jon_o_owner_axiom,axiom,
owner(jon,odie),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',jon_o_owner_axiom) ).
fof(jon_type,axiom,
human(jon),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',jon_type) ).
fof(garfield_type,axiom,
cat(garfield),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',garfield_type) ).
fof(jon_g_owner_axiom,axiom,
owner(jon,garfield),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',jon_g_owner_axiom) ).
fof(jon_conjecture,conjecture,
hates(jon,jon),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',jon_conjecture) ).
fof(odie_chase_axiom,axiom,
chased(odie,garfield),
file('/export/starexec/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p',odie_chase_axiom) ).
fof(c_0_11,plain,
! [X14] :
( ~ dog(X14)
| pet(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dog_pet_type])]) ).
fof(c_0_12,plain,
! [X11,X12] :
( ( ~ owner(X11,X12)
| X11 = owner_of(X12)
| ~ human(X11)
| ~ pet(X12) )
& ( X11 != owner_of(X12)
| owner(X11,X12)
| ~ human(X11)
| ~ pet(X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owner_def])])]) ).
cnf(c_0_13,plain,
( pet(X1)
| ~ dog(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
dog(odie),
inference(split_conjunct,[status(thm)],[odie_type]) ).
fof(c_0_15,plain,
! [X16] :
( ~ cat(X16)
| pet(X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cat_pet_type])]) ).
fof(c_0_16,plain,
! [X4,X5] :
( ~ cat(X4)
| ~ dog(X5)
| ~ chased(X5,X4)
| hates(owner_of(X4),owner_of(X5)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cat_chase_axiom])]) ).
cnf(c_0_17,plain,
( X1 = owner_of(X2)
| ~ owner(X1,X2)
| ~ human(X1)
| ~ pet(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
owner(jon,odie),
inference(split_conjunct,[status(thm)],[jon_o_owner_axiom]) ).
cnf(c_0_19,plain,
human(jon),
inference(split_conjunct,[status(thm)],[jon_type]) ).
cnf(c_0_20,plain,
pet(odie),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( pet(X1)
| ~ cat(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
cat(garfield),
inference(split_conjunct,[status(thm)],[garfield_type]) ).
cnf(c_0_23,plain,
( hates(owner_of(X1),owner_of(X2))
| ~ cat(X1)
| ~ dog(X2)
| ~ chased(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
owner_of(odie) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
owner(jon,garfield),
inference(split_conjunct,[status(thm)],[jon_g_owner_axiom]) ).
cnf(c_0_26,plain,
pet(garfield),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_27,negated_conjecture,
~ hates(jon,jon),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[jon_conjecture])]) ).
cnf(c_0_28,plain,
( hates(owner_of(X1),jon)
| ~ chased(odie,X1)
| ~ cat(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14])]) ).
cnf(c_0_29,plain,
owner_of(garfield) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_19]),c_0_26])]) ).
cnf(c_0_30,plain,
chased(odie,garfield),
inference(split_conjunct,[status(thm)],[odie_chase_axiom]) ).
cnf(c_0_31,negated_conjecture,
~ hates(jon,jon),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_22])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ130+1 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 19:12:07 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.NZjqAeW2St/E---3.1_13645.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # new_bool_3 with pid 13727 completed with status 0
% 0.16/0.44 # Result found by new_bool_3
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGUSF-FFSM11-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 13733 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGUSF-FFSM11-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 19
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 23
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 23
% 0.16/0.44 # Processed clauses : 100
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 15
% 0.16/0.44 # ...remaining for further processing : 85
% 0.16/0.44 # Other redundant clauses eliminated : 1
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 18
% 0.16/0.44 # Backward-rewritten : 11
% 0.16/0.44 # Generated clauses : 309
% 0.16/0.44 # ...of the previous two non-redundant : 297
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 1
% 0.16/0.44 # Paramodulations : 302
% 0.16/0.44 # Factorizations : 6
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 1
% 0.16/0.44 # Total rewrite steps : 35
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 32
% 0.16/0.44 # Positive orientable unit clauses : 20
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 11
% 0.16/0.44 # Current number of unprocessed clauses: 26
% 0.16/0.44 # ...number of literals in the above : 121
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 52
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 121
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 105
% 0.16/0.44 # Non-unit clause-clause subsumptions : 24
% 0.16/0.44 # Unit Clause-clause subsumption calls : 21
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 4
% 0.16/0.44 # BW rewrite match successes : 4
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 2496
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.007 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.009 s
% 0.16/0.44 # Maximum resident set size: 1732 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.007 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.010 s
% 0.16/0.44 # Maximum resident set size: 1684 pages
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------