TSTP Solution File: PHI014+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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 16:48:54 EDT 2022
% Result : Theorem 0.21s 0.45s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 5 unt; 4 nHn; 17 RR)
% Number of literals : 47 ( 0 equ; 29 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
object(skf3(u)),
file('PHI014+1.p',unknown),
[] ).
cnf(3,axiom,
is_the(god,none_greater),
file('PHI014+1.p',unknown),
[] ).
cnf(4,axiom,
~ exemplifies_property(existence,god),
file('PHI014+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ is_the(u,v)
| property(v) ),
file('PHI014+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ is_the(u,v)
| object(u) ),
file('PHI014+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ property(u)
| ~ object(v)
| ~ is_the(v,u)
| exemplifies_property(u,v) ),
file('PHI014+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ object(u)
| ~ is_the(u,none_greater)
| exemplifies_property(conceivable,skf3(u))
| exemplifies_property(existence,u) ),
file('PHI014+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ object(u)
| ~ is_the(u,none_greater)
| exemplifies_relation(greater_than,skf3(u),u)
| exemplifies_property(existence,u) ),
file('PHI014+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ object(u)
| ~ object(v)
| ~ exemplifies_property(none_greater,u)
| ~ exemplifies_property(conceivable,v)
| ~ exemplifies_relation(greater_than,v,u) ),
file('PHI014+1.p',unknown),
[] ).
cnf(14,plain,
( ~ is_the(u,v)
| exemplifies_property(v,u) ),
inference(mrr,[status(thm)],[8,5,6]),
[iquote('0:MRR:8.0,8.1,5.1,6.1')] ).
cnf(15,plain,
( ~ is_the(u,none_greater)
| exemplifies_property(existence,u)
| exemplifies_property(conceivable,skf3(u)) ),
inference(mrr,[status(thm)],[10,6]),
[iquote('0:MRR:10.0,6.1')] ).
cnf(16,plain,
( ~ is_the(u,none_greater)
| exemplifies_property(existence,u)
| exemplifies_relation(greater_than,skf3(u),u) ),
inference(mrr,[status(thm)],[12,6]),
[iquote('0:MRR:12.0,6.1')] ).
cnf(32,plain,
( ~ object(u)
| ~ object(skf3(u))
| ~ is_the(u,none_greater)
| ~ exemplifies_property(none_greater,u)
| ~ exemplifies_property(conceivable,skf3(u))
| exemplifies_property(existence,u) ),
inference(res,[status(thm),theory(equality)],[16,13]),
[iquote('0:Res:16.2,13.4')] ).
cnf(36,plain,
( ~ object(u)
| ~ is_the(u,none_greater)
| ~ exemplifies_property(none_greater,u)
| ~ exemplifies_property(conceivable,skf3(u))
| exemplifies_property(existence,u) ),
inference(ssi,[status(thm)],[32,2]),
[iquote('0:SSi:32.1,2.0')] ).
cnf(37,plain,
( ~ is_the(u,none_greater)
| exemplifies_property(existence,u) ),
inference(mrr,[status(thm)],[36,6,14,15]),
[iquote('0:MRR:36.0,36.2,36.3,6.1,14.1,15.2')] ).
cnf(38,plain,
~ is_the(god,none_greater),
inference(res,[status(thm),theory(equality)],[37,4]),
[iquote('0:Res:37.1,4.0')] ).
cnf(39,plain,
$false,
inference(mrr,[status(thm)],[38,3]),
[iquote('0:MRR:38.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n017.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 : 600
% 0.13/0.34 % DateTime : Thu Jun 2 00:40:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.45
% 0.21/0.45 SPASS V 3.9
% 0.21/0.45 SPASS beiseite: Proof found.
% 0.21/0.45 % SZS status Theorem
% 0.21/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.45 SPASS derived 11 clauses, backtracked 0 clauses, performed 0 splits and kept 22 clauses.
% 0.21/0.45 SPASS allocated 97638 KBytes.
% 0.21/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.45 0:00:00.04 for the input.
% 0.21/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.45 0:00:00.00 for inferences.
% 0.21/0.45 0:00:00.00 for the backtracking.
% 0.21/0.45 0:00:00.00 for the reduction.
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Here is a proof with depth 2, length 17 :
% 0.21/0.45 % SZS output start Refutation
% See solution above
% 0.21/0.45 Formulae used in the proof : premise_2 definition_god description_is_property_and_described_is_object god_exists description_theorem_2 definition_none_greater
% 0.21/0.45
%------------------------------------------------------------------------------