TSTP Solution File: KRS265+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS265+1 : TPTP v8.1.0. Bugfixed v5.4.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 : Sun Jul 17 03:31:01 EDT 2022
% Result : Theorem 0.47s 0.64s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 4 unt; 3 nHn; 12 RR)
% Number of literals : 21 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
~ mighta(cax,thm),
file('KRS265+1.p',unknown),
[] ).
cnf(11,axiom,
~ model(u,skc61),
file('KRS265+1.p',unknown),
[] ).
cnf(28,axiom,
( model(skf81(u),u)
| status__dfg(u,v,cax) ),
file('KRS265+1.p',unknown),
[] ).
cnf(32,axiom,
( model(skf61(u,v),v)
| status__dfg(v,u,thm) ),
file('KRS265+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ model(u,v)
| ~ status__dfg(v,w,cax) ),
file('KRS265+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ status__dfg(u,v,w)
| ~ status__dfg(u,v,x)
| mighta(x,w) ),
file('KRS265+1.p',unknown),
[] ).
cnf(112,plain,
( ~ status__dfg(u,v,thm)
| ~ status__dfg(u,v,cax) ),
inference(res,[status(thm),theory(equality)],[92,9]),
[iquote('0:Res:92.2,9.0')] ).
cnf(169,plain,
( ~ model(u,v)
| model(skf81(v),v) ),
inference(res,[status(thm),theory(equality)],[28,39]),
[iquote('0:Res:28.1,39.1')] ).
cnf(190,plain,
( status__dfg(u,v,thm)
| model(skf81(u),u) ),
inference(res,[status(thm),theory(equality)],[32,169]),
[iquote('0:Res:32.0,169.0')] ).
cnf(351,plain,
( ~ status__dfg(u,v,thm)
| model(skf81(u),u) ),
inference(res,[status(thm),theory(equality)],[28,112]),
[iquote('0:Res:28.1,112.1')] ).
cnf(356,plain,
model(skf81(u),u),
inference(mrr,[status(thm)],[351,190]),
[iquote('0:MRR:351.0,190.0')] ).
cnf(357,plain,
$false,
inference(unc,[status(thm)],[356,11]),
[iquote('0:UnC:356.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS265+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.04/0.13 % 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 : Tue Jun 7 17:39:02 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.47/0.64
% 0.47/0.64 SPASS V 3.9
% 0.47/0.64 SPASS beiseite: Proof found.
% 0.47/0.64 % SZS status Theorem
% 0.47/0.64 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.64 SPASS derived 240 clauses, backtracked 0 clauses, performed 1 splits and kept 272 clauses.
% 0.47/0.64 SPASS allocated 87718 KBytes.
% 0.47/0.64 SPASS spent 0:00:00.29 on the problem.
% 0.47/0.64 0:00:00.04 for the input.
% 0.47/0.64 0:00:00.20 for the FLOTTER CNF translation.
% 0.47/0.64 0:00:00.00 for inferences.
% 0.47/0.64 0:00:00.00 for the backtracking.
% 0.47/0.64 0:00:00.02 for the reduction.
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 Here is a proof with depth 2, length 12 :
% 0.47/0.64 % SZS output start Refutation
% See solution above
% 0.47/0.64 Formulae used in the proof : mighta_cax_thm contradiction cax thm mighta
% 0.47/0.64
%------------------------------------------------------------------------------