TSTP Solution File: PHI013+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PHI013+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.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 8 unt; 4 nHn; 21 RR)
% Number of literals : 47 ( 0 equ; 26 neg)
% Maximal clause size : 5 ( 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(6,axiom,
object(skf7(u)),
file('PHI013+1.p',unknown),
[] ).
cnf(7,axiom,
is_the(god,none_greater),
file('PHI013+1.p',unknown),
[] ).
cnf(8,axiom,
~ exemplifies_property(existence,god),
file('PHI013+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ is_the(u,v)
| property(v) ),
file('PHI013+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ is_the(u,v)
| object(u) ),
file('PHI013+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ property(u)
| ~ object(v)
| ~ is_the(v,u)
| exemplifies_property(u,v) ),
file('PHI013+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ object(u)
| ~ is_the(u,none_greater)
| exemplifies_property(conceivable,skf7(u))
| exemplifies_property(existence,u) ),
file('PHI013+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ object(u)
| ~ is_the(u,none_greater)
| exemplifies_relation(greater_than,skf7(u),u)
| exemplifies_property(existence,u) ),
file('PHI013+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ object(u)
| ~ object(v)
| ~ exemplifies_property(none_greater,u)
| ~ exemplifies_property(conceivable,v)
| ~ exemplifies_relation(greater_than,v,u) ),
file('PHI013+1.p',unknown),
[] ).
cnf(24,plain,
( ~ is_the(u,v)
| exemplifies_property(v,u) ),
inference(mrr,[status(thm)],[16,10,11]),
[iquote('0:MRR:16.0,16.1,10.1,11.1')] ).
cnf(25,plain,
( ~ is_the(u,none_greater)
| exemplifies_property(existence,u)
| exemplifies_property(conceivable,skf7(u)) ),
inference(mrr,[status(thm)],[19,11]),
[iquote('0:MRR:19.0,11.1')] ).
cnf(26,plain,
( ~ is_the(u,none_greater)
| exemplifies_property(existence,u)
| exemplifies_relation(greater_than,skf7(u),u) ),
inference(mrr,[status(thm)],[22,11]),
[iquote('0:MRR:22.0,11.1')] ).
cnf(28,plain,
( ~ is_the(god,none_greater)
| exemplifies_relation(greater_than,skf7(god),god) ),
inference(res,[status(thm),theory(equality)],[26,8]),
[iquote('0:Res:26.2,8.0')] ).
cnf(29,plain,
( ~ is_the(god,none_greater)
| exemplifies_property(conceivable,skf7(god)) ),
inference(res,[status(thm),theory(equality)],[25,8]),
[iquote('0:Res:25.2,8.0')] ).
cnf(30,plain,
exemplifies_property(conceivable,skf7(god)),
inference(mrr,[status(thm)],[29,7]),
[iquote('0:MRR:29.0,7.0')] ).
cnf(31,plain,
exemplifies_relation(greater_than,skf7(god),god),
inference(mrr,[status(thm)],[28,7]),
[iquote('0:MRR:28.0,7.0')] ).
cnf(43,plain,
object(god),
inference(res,[status(thm),theory(equality)],[7,11]),
[iquote('0:Res:7.0,11.0')] ).
cnf(44,plain,
exemplifies_property(none_greater,god),
inference(res,[status(thm),theory(equality)],[7,24]),
[iquote('0:Res:7.0,24.0')] ).
cnf(89,plain,
( ~ object(god)
| ~ object(skf7(god))
| ~ exemplifies_property(none_greater,god)
| ~ exemplifies_property(conceivable,skf7(god)) ),
inference(res,[status(thm),theory(equality)],[31,23]),
[iquote('0:Res:31.0,23.4')] ).
cnf(92,plain,
( ~ exemplifies_property(none_greater,god)
| ~ exemplifies_property(conceivable,skf7(god)) ),
inference(ssi,[status(thm)],[89,6,43]),
[iquote('0:SSi:89.1,89.0,6.0,43.0,43.0')] ).
cnf(93,plain,
$false,
inference(mrr,[status(thm)],[92,44,30]),
[iquote('0:MRR:92.0,92.1,44.0,30.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PHI013+1 : TPTP v8.1.0. Released v7.2.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 2 00:22:57 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 41 clauses, backtracked 0 clauses, performed 1 splits and kept 43 clauses.
% 0.20/0.44 SPASS allocated 103924 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 2, length 21 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : premise_2 premise_1 definition_god god_exists description_is_property_and_described_is_object description_theorem_2 definition_none_greater
% 0.20/0.44
%------------------------------------------------------------------------------