TSTP Solution File: PUZ130+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:27:33 EDT 2022
% Result : Theorem 0.17s 0.42s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 20 RR)
% Number of literals : 40 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cat(garfield),
file('PUZ130+1.p',unknown),
[] ).
cnf(4,axiom,
dog(odie),
file('PUZ130+1.p',unknown),
[] ).
cnf(7,axiom,
human(jon),
file('PUZ130+1.p',unknown),
[] ).
cnf(11,axiom,
owner(jon,odie),
file('PUZ130+1.p',unknown),
[] ).
cnf(12,axiom,
owner(jon,garfield),
file('PUZ130+1.p',unknown),
[] ).
cnf(13,axiom,
chased(odie,garfield),
file('PUZ130+1.p',unknown),
[] ).
cnf(14,axiom,
~ hates(jon,jon),
file('PUZ130+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ dog(u)
| pet(u) ),
file('PUZ130+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cat(u)
| pet(u) ),
file('PUZ130+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ pet(u)
| ~ human(v)
| ~ owner(v,u)
| equal(v,owner_of(u)) ),
file('PUZ130+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ dog(u)
| ~ cat(v)
| ~ chased(u,v)
| hates(owner_of(v),owner_of(u)) ),
file('PUZ130+1.p',unknown),
[] ).
cnf(24,plain,
( ~ pet(garfield)
| ~ human(jon)
| equal(owner_of(garfield),jon) ),
inference(res,[status(thm),theory(equality)],[12,21]),
[iquote('0:Res:12.0,21.2')] ).
cnf(25,plain,
( ~ pet(odie)
| ~ human(jon)
| equal(owner_of(odie),jon) ),
inference(res,[status(thm),theory(equality)],[11,21]),
[iquote('0:Res:11.0,21.2')] ).
cnf(27,plain,
equal(owner_of(garfield),jon),
inference(ssi,[status(thm)],[24,7,16,2]),
[iquote('0:SSi:24.1,24.0,7.0,16.1,2.0')] ).
cnf(28,plain,
equal(owner_of(odie),jon),
inference(ssi,[status(thm)],[25,7,15,4]),
[iquote('0:SSi:25.1,25.0,7.0,15.1,4.0')] ).
cnf(39,plain,
( ~ dog(odie)
| ~ cat(u)
| ~ chased(odie,u)
| hates(owner_of(u),jon) ),
inference(spr,[status(thm),theory(equality)],[28,23]),
[iquote('0:SpR:28.0,23.3')] ).
cnf(42,plain,
( ~ cat(u)
| ~ chased(odie,u)
| hates(owner_of(u),jon) ),
inference(ssi,[status(thm)],[39,4]),
[iquote('0:SSi:39.0,4.0')] ).
cnf(44,plain,
( ~ cat(garfield)
| ~ chased(odie,garfield)
| hates(jon,jon) ),
inference(spr,[status(thm),theory(equality)],[27,42]),
[iquote('0:SpR:27.0,42.2')] ).
cnf(46,plain,
( ~ chased(odie,garfield)
| hates(jon,jon) ),
inference(ssi,[status(thm)],[44,2]),
[iquote('0:SSi:44.0,2.0')] ).
cnf(47,plain,
$false,
inference(mrr,[status(thm)],[46,13,14]),
[iquote('0:MRR:46.0,46.1,13.0,14.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n027.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:06:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.42
% 0.17/0.42 SPASS V 3.9
% 0.17/0.42 SPASS beiseite: Proof found.
% 0.17/0.42 % SZS status Theorem
% 0.17/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 SPASS derived 16 clauses, backtracked 0 clauses, performed 0 splits and kept 34 clauses.
% 0.17/0.42 SPASS allocated 97667 KBytes.
% 0.17/0.42 SPASS spent 0:00:00.08 on the problem.
% 0.17/0.42 0:00:00.03 for the input.
% 0.17/0.42 0:00:00.03 for the FLOTTER CNF translation.
% 0.17/0.42 0:00:00.00 for inferences.
% 0.17/0.42 0:00:00.00 for the backtracking.
% 0.17/0.42 0:00:00.00 for the reduction.
% 0.17/0.42
% 0.17/0.42
% 0.17/0.42 Here is a proof with depth 3, length 20 :
% 0.17/0.42 % SZS output start Refutation
% See solution above
% 0.17/0.42 Formulae used in the proof : garfield_type odie_type jon_type jon_o_owner_axiom jon_g_owner_axiom odie_chase_axiom jon_conjecture dog_pet_type cat_pet_type owner_def cat_chase_axiom
% 0.17/0.42
%------------------------------------------------------------------------------