%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PHI015+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.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 8 unt; 4 nHn; 24 RR)
% Number of literals : 57 ( 0 equ; 36 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
is_the(god,none_greater),
file('PHI015+1.p',unknown),
[] ).
cnf(6,axiom,
~ exemplifies_property(existence,god),
file('PHI015+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ exemplifies_property(u,v)
| object(v) ),
file('PHI015+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ is_the(u,v)
| property(v) ),
file('PHI015+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ is_the(u,v)
| object(u) ),
file('PHI015+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ object(u)
| ~ is_the(u,none_greater)
| exemplifies_property(conceivable,skf9(u))
| exemplifies_property(existence,u) ),
file('PHI015+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ object(u)
| ~ is_the(u,none_greater)
| exemplifies_relation(greater_than,skf9(u),u)
| exemplifies_property(existence,u) ),
file('PHI015+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ object(u)
| ~ object(v)
| ~ exemplifies_property(conceivable,u)
| ~ exemplifies_property(none_greater,v)
| ~ exemplifies_relation(greater_than,u,v) ),
file('PHI015+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ property(u)
| ~ object(v)
| ~ object(w)
| ~ equal(v,w)
| ~ is_the(v,u)
| exemplifies_property(u,w) ),
file('PHI015+1.p',unknown),
[] ).
cnf(36,plain,
( ~ is_the(u,none_greater)
| exemplifies_property(existence,u)
| exemplifies_property(conceivable,skf9(u)) ),
inference(mrr,[status(thm)],[17,14]),
[iquote('0:MRR:17.0,14.1')] ).
cnf(38,plain,
( ~ is_the(u,none_greater)
| exemplifies_property(existence,u)
| exemplifies_relation(greater_than,skf9(u),u) ),
inference(mrr,[status(thm)],[19,14]),
[iquote('0:MRR:19.0,14.1')] ).
cnf(40,plain,
( ~ exemplifies_property(none_greater,u)
| ~ exemplifies_property(conceivable,v)
| ~ exemplifies_relation(greater_than,v,u) ),
inference(mrr,[status(thm)],[21,12]),
[iquote('0:MRR:21.0,21.1,12.1,12.1')] ).
cnf(41,plain,
( ~ object(u)
| ~ is_the(v,w)
| ~ equal(v,u)
| exemplifies_property(w,u) ),
inference(mrr,[status(thm)],[22,13,14]),
[iquote('0:MRR:22.0,22.1,13.1,14.1')] ).
cnf(54,plain,
( ~ is_the(god,none_greater)
| exemplifies_relation(greater_than,skf9(god),god) ),
inference(res,[status(thm),theory(equality)],[38,6]),
[iquote('0:Res:38.2,6.0')] ).
cnf(55,plain,
( ~ is_the(god,none_greater)
| exemplifies_property(conceivable,skf9(god)) ),
inference(res,[status(thm),theory(equality)],[36,6]),
[iquote('0:Res:36.2,6.0')] ).
cnf(59,plain,
exemplifies_property(conceivable,skf9(god)),
inference(mrr,[status(thm)],[55,5]),
[iquote('0:MRR:55.0,5.0')] ).
cnf(60,plain,
exemplifies_relation(greater_than,skf9(god),god),
inference(mrr,[status(thm)],[54,5]),
[iquote('0:MRR:54.0,5.0')] ).
cnf(74,plain,
object(god),
inference(res,[status(thm),theory(equality)],[5,14]),
[iquote('0:Res:5.0,14.0')] ).
cnf(86,plain,
( ~ exemplifies_property(none_greater,god)
| ~ exemplifies_property(conceivable,skf9(god)) ),
inference(res,[status(thm),theory(equality)],[60,40]),
[iquote('0:Res:60.0,40.2')] ).
cnf(89,plain,
~ exemplifies_property(none_greater,god),
inference(mrr,[status(thm)],[86,59]),
[iquote('0:MRR:86.1,59.0')] ).
cnf(100,plain,
( ~ object(u)
| ~ equal(god,u)
| exemplifies_property(none_greater,u) ),
inference(res,[status(thm),theory(equality)],[5,41]),
[iquote('0:Res:5.0,41.1')] ).
cnf(101,plain,
( ~ object(god)
| ~ equal(god,god) ),
inference(res,[status(thm),theory(equality)],[100,89]),
[iquote('0:Res:100.2,89.0')] ).
cnf(104,plain,
~ object(god),
inference(obv,[status(thm),theory(equality)],[101]),
[iquote('0:Obv:101.1')] ).
cnf(105,plain,
$false,
inference(ssi,[status(thm)],[104,74]),
[iquote('0:SSi:104.0,74.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI015+1 : TPTP v8.1.0. Released v7.2.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.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 : Thu Jun 2 00:35:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44
% 0.18/0.44 SPASS V 3.9
% 0.18/0.44 SPASS beiseite: Proof found.
% 0.18/0.44 % SZS status Theorem
% 0.18/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 SPASS derived 36 clauses, backtracked 0 clauses, performed 0 splits and kept 51 clauses.
% 0.18/0.44 SPASS allocated 104052 KBytes.
% 0.18/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.44 0:00:00.04 for the input.
% 0.18/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44 0:00:00.00 for inferences.
% 0.18/0.44 0:00:00.00 for the backtracking.
% 0.18/0.44 0:00:00.00 for the reduction.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Here is a proof with depth 3, length 24 :
% 0.18/0.44 % SZS output start Refutation
% See solution above
% 0.18/0.44 Formulae used in the proof : definition_god god_exists exemplifier_is_object_and_exemplified_is_property description_is_property_and_described_is_object premise_2 premise_1 definition_none_greater description_axiom_identity_instance
% 0.18/0.44
%------------------------------------------------------------------------------