TSTP Solution File: PHI009+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 6 unt; 2 nHn; 20 RR)
% Number of literals : 59 ( 0 equ; 43 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
object(skc3),
file('PHI009+1.p',unknown),
[] ).
cnf(2,axiom,
property(skc2),
file('PHI009+1.p',unknown),
[] ).
cnf(3,axiom,
exemplifies_property(skc2,skc3),
file('PHI009+1.p',unknown),
[] ).
cnf(4,axiom,
object(skf3(u,v)),
file('PHI009+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ object(u)
| ~ is_the(u,skc2) ),
file('PHI009+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ object(u)
| ~ exemplifies_property(skc2,u)
| equal(u,skc3) ),
file('PHI009+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ object(u)
| ~ property(v)
| ~ object(w)
| ~ exemplifies_property(v,w)
| is_the(u,v)
| exemplifies_property(v,skf3(w,v)) ),
file('PHI009+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ object(u)
| ~ property(v)
| ~ object(w)
| ~ exemplifies_property(v,w)
| ~ equal(skf3(w,v),w)
| is_the(u,v) ),
file('PHI009+1.p',unknown),
[] ).
cnf(20,plain,
( ~ object(u)
| ~ object(v)
| ~ equal(skf3(u,skc2),u)
| ~ exemplifies_property(skc2,u)
| is_the(v,skc2) ),
inference(res,[status(thm),theory(equality)],[2,9]),
[iquote('0:Res:2.0,9.1')] ).
cnf(21,plain,
( ~ object(u)
| ~ object(v)
| ~ exemplifies_property(skc2,u)
| is_the(v,skc2)
| exemplifies_property(skc2,skf3(u,skc2)) ),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.0,8.1')] ).
cnf(41,plain,
( ~ object(u)
| ~ object(v)
| ~ exemplifies_property(skc2,v)
| exemplifies_property(skc2,skf3(v,skc2)) ),
inference(mrr,[status(thm)],[21,6]),
[iquote('0:MRR:21.3,6.1')] ).
cnf(42,plain,
( ~ object(u)
| ~ object(v)
| ~ exemplifies_property(skc2,v)
| ~ equal(skf3(v,skc2),v) ),
inference(mrr,[status(thm)],[20,6]),
[iquote('0:MRR:20.4,6.1')] ).
cnf(92,plain,
( ~ object(u)
| ~ exemplifies_property(skc2,u)
| exemplifies_property(skc2,skf3(u,skc2)) ),
inference(con,[status(thm)],[41]),
[iquote('0:Con:41.0')] ).
cnf(93,plain,
( ~ object(u)
| ~ exemplifies_property(skc2,u)
| ~ equal(skf3(u,skc2),u) ),
inference(con,[status(thm)],[42]),
[iquote('0:Con:42.0')] ).
cnf(102,plain,
( ~ object(u)
| ~ object(skf3(u,skc2))
| ~ exemplifies_property(skc2,u)
| equal(skf3(u,skc2),skc3) ),
inference(res,[status(thm),theory(equality)],[92,7]),
[iquote('0:Res:92.2,7.1')] ).
cnf(103,plain,
( ~ object(u)
| ~ exemplifies_property(skc2,u)
| equal(skf3(u,skc2),skc3) ),
inference(ssi,[status(thm)],[102,4,2]),
[iquote('0:SSi:102.1,4.0,2.0')] ).
cnf(105,plain,
( ~ object(u)
| ~ exemplifies_property(skc2,u)
| ~ equal(skc3,u) ),
inference(rew,[status(thm),theory(equality)],[103,93]),
[iquote('0:Rew:103.2,93.2')] ).
cnf(106,plain,
( ~ object(skc3)
| ~ equal(skc3,skc3) ),
inference(res,[status(thm),theory(equality)],[3,105]),
[iquote('0:Res:3.0,105.1')] ).
cnf(108,plain,
~ object(skc3),
inference(obv,[status(thm),theory(equality)],[106]),
[iquote('0:Obv:106.1')] ).
cnf(109,plain,
$false,
inference(ssi,[status(thm)],[108,1]),
[iquote('0:SSi:108.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 2 01:32:31 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 74 clauses, backtracked 29 clauses, performed 2 splits and kept 85 clauses.
% 0.20/0.46 SPASS allocated 103974 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.46 0:00:00.03 for the input.
% 0.20/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.01 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 2, length 20 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.47 Formulae used in the proof : description_theorem_1 description_axiom_schema_instance
% 0.20/0.47
%------------------------------------------------------------------------------