%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 : 600s
% DateTime : Mon Jul 18 18:10:53 EDT 2022
% Result : Theorem 0.22s 1.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 21 unt; 0 def)
% Number of atoms : 64 ( 6 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 54 ( 24 ~; 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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dog_pet_type) ).
fof(owner_def,axiom,
! [X2,X3] :
( ( human(X2)
& pet(X3) )
=> ( owner(X2,X3)
<=> X2 = owner_of(X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owner_def) ).
fof(odie_type,axiom,
dog(odie),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',odie_type) ).
fof(cat_pet_type,axiom,
! [X1] :
( cat(X1)
=> pet(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cat_chase_axiom) ).
fof(jon_o_owner_axiom,axiom,
owner(jon,odie),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',jon_o_owner_axiom) ).
fof(jon_type,axiom,
human(jon),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',jon_type) ).
fof(garfield_type,axiom,
cat(garfield),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',garfield_type) ).
fof(jon_conjecture,conjecture,
hates(jon,jon),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',jon_conjecture) ).
fof(jon_g_owner_axiom,axiom,
owner(jon,garfield),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',jon_g_owner_axiom) ).
fof(odie_chase_axiom,axiom,
chased(odie,garfield),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',odie_chase_axiom) ).
fof(c_0_11,plain,
! [X2] :
( ~ dog(X2)
| pet(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dog_pet_type])]) ).
fof(c_0_12,plain,
! [X4,X5] :
( ( ~ owner(X4,X5)
| X4 = owner_of(X5)
| ~ human(X4)
| ~ pet(X5) )
& ( X4 != owner_of(X5)
| owner(X4,X5)
| ~ human(X4)
| ~ pet(X5) ) ),
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,
! [X2] :
( ~ cat(X2)
| pet(X2) ),
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,
( X2 = owner_of(X1)
| ~ pet(X1)
| ~ human(X2)
| ~ owner(X2,X1) ),
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]) ).
fof(c_0_23,negated_conjecture,
~ hates(jon,jon),
inference(assume_negation,[status(cth)],[jon_conjecture]) ).
cnf(c_0_24,plain,
( hates(owner_of(X1),owner_of(X2))
| ~ chased(X2,X1)
| ~ dog(X2)
| ~ cat(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
owner_of(odie) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[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_26,plain,
owner(jon,garfield),
inference(split_conjunct,[status(thm)],[jon_g_owner_axiom]) ).
cnf(c_0_27,plain,
pet(garfield),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_28,negated_conjecture,
~ hates(jon,jon),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
cnf(c_0_29,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_24,c_0_25]),c_0_14])]) ).
cnf(c_0_30,plain,
owner_of(garfield) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_19])]),c_0_27])]) ).
cnf(c_0_31,plain,
chased(odie,garfield),
inference(split_conjunct,[status(thm)],[odie_chase_axiom]) ).
cnf(c_0_32,negated_conjecture,
~ hates(jon,jon),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_22])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat May 28 23:00:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.39 # Preprocessing time : 0.015 s
% 0.22/1.39
% 0.22/1.39 # Proof found!
% 0.22/1.39 # SZS status Theorem
% 0.22/1.39 # SZS output start CNFRefutation
% See solution above
% 0.22/1.39 # Proof object total steps : 34
% 0.22/1.39 # Proof object clause steps : 17
% 0.22/1.39 # Proof object formula steps : 17
% 0.22/1.39 # Proof object conjectures : 4
% 0.22/1.39 # Proof object clause conjectures : 1
% 0.22/1.39 # Proof object formula conjectures : 3
% 0.22/1.39 # Proof object initial clauses used : 11
% 0.22/1.39 # Proof object initial formulas used : 11
% 0.22/1.39 # Proof object generating inferences : 6
% 0.22/1.39 # Proof object simplifying inferences : 14
% 0.22/1.39 # Training examples: 0 positive, 0 negative
% 0.22/1.39 # Parsed axioms : 19
% 0.22/1.39 # Removed by relevancy pruning/SinE : 0
% 0.22/1.39 # Initial clauses : 23
% 0.22/1.39 # Removed in clause preprocessing : 0
% 0.22/1.39 # Initial clauses in saturation : 23
% 0.22/1.39 # Processed clauses : 83
% 0.22/1.39 # ...of these trivial : 0
% 0.22/1.39 # ...subsumed : 24
% 0.22/1.39 # ...remaining for further processing : 59
% 0.22/1.39 # Other redundant clauses eliminated : 7
% 0.22/1.39 # Clauses deleted for lack of memory : 0
% 0.22/1.39 # Backward-subsumed : 11
% 0.22/1.39 # Backward-rewritten : 6
% 0.22/1.39 # Generated clauses : 331
% 0.22/1.39 # ...of the previous two non-trivial : 313
% 0.22/1.39 # Contextual simplify-reflections : 4
% 0.22/1.39 # Paramodulations : 319
% 0.22/1.39 # Factorizations : 4
% 0.22/1.39 # Equation resolutions : 8
% 0.22/1.39 # Current number of processed clauses : 42
% 0.22/1.39 # Positive orientable unit clauses : 20
% 0.22/1.39 # Positive unorientable unit clauses: 0
% 0.22/1.39 # Negative unit clauses : 1
% 0.22/1.39 # Non-unit-clauses : 21
% 0.22/1.39 # Current number of unprocessed clauses: 12
% 0.22/1.39 # ...number of literals in the above : 53
% 0.22/1.39 # Current number of archived formulas : 0
% 0.22/1.39 # Current number of archived clauses : 17
% 0.22/1.39 # Clause-clause subsumption calls (NU) : 147
% 0.22/1.39 # Rec. Clause-clause subsumption calls : 119
% 0.22/1.39 # Non-unit clause-clause subsumptions : 30
% 0.22/1.39 # Unit Clause-clause subsumption calls : 17
% 0.22/1.39 # Rewrite failures with RHS unbound : 0
% 0.22/1.39 # BW rewrite match attempts : 3
% 0.22/1.39 # BW rewrite match successes : 3
% 0.22/1.39 # Condensation attempts : 0
% 0.22/1.39 # Condensation successes : 0
% 0.22/1.39 # Termbank termtop insertions : 2524
% 0.22/1.39
% 0.22/1.39 # -------------------------------------------------
% 0.22/1.39 # User time : 0.016 s
% 0.22/1.39 # System time : 0.004 s
% 0.22/1.39 # Total time : 0.020 s
% 0.22/1.39 # Maximum resident set size: 2948 pages
%------------------------------------------------------------------------------