TSTP Solution File: PUZ061+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:26 EDT 2022
% Result : Theorem 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 6 unt; 0 nHn; 11 RR)
% Number of literals : 18 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
alive(skc7),
file('PUZ061+1.p',unknown),
[] ).
cnf(4,axiom,
eats(skc7,skc10),
file('PUZ061+1.p',unknown),
[] ).
cnf(5,axiom,
~ likes(skc9,skc10),
file('PUZ061+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ food(u)
| likes(skc9,u) ),
file('PUZ061+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ alive(u)
| not_killed_by(u,v) ),
file('PUZ061+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ not_killed_by(u,v)
| ~ eats(u,v)
| food(v) ),
file('PUZ061+1.p',unknown),
[] ).
cnf(15,plain,
~ food(skc10),
inference(res,[status(thm),theory(equality)],[6,5]),
[iquote('0:Res:6.1,5.0')] ).
cnf(17,plain,
( ~ alive(u)
| ~ eats(u,v)
| food(v) ),
inference(res,[status(thm),theory(equality)],[7,10]),
[iquote('0:Res:7.1,10.0')] ).
cnf(18,plain,
( ~ alive(skc7)
| food(skc10) ),
inference(res,[status(thm),theory(equality)],[4,17]),
[iquote('0:Res:4.0,17.1')] ).
cnf(20,plain,
food(skc10),
inference(ssi,[status(thm)],[18,2]),
[iquote('0:SSi:18.0,2.0')] ).
cnf(21,plain,
$false,
inference(mrr,[status(thm)],[20,15]),
[iquote('0:MRR:20.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat May 28 21:31:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.42
% 0.20/0.42 SPASS V 3.9
% 0.20/0.42 SPASS beiseite: Proof found.
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.20/0.42 SPASS allocated 97579 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.42 0:00:00.04 for the input.
% 0.20/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.42 0:00:00.00 for inferences.
% 0.20/0.42 0:00:00.00 for the backtracking.
% 0.20/0.42 0:00:00.00 for the reduction.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Here is a proof with depth 2, length 11 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : prove_this
% 0.20/0.42
%------------------------------------------------------------------------------