TSTP Solution File: KRS152+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS152+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:30:43 EDT 2022
% Result : Theorem 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 19 ( 7 unt; 3 nHn; 19 RR)
% Number of literals : 48 ( 0 equ; 33 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
cowlThing(u),
file('KRS152+1.p',unknown),
[] ).
cnf(2,axiom,
cTEST(iV21080),
file('KRS152+1.p',unknown),
[] ).
cnf(5,axiom,
cC2(iV21081),
file('KRS152+1.p',unknown),
[] ).
cnf(6,axiom,
cC4(iV21081),
file('KRS152+1.p',unknown),
[] ).
cnf(7,axiom,
~ cowlNothing(u),
file('KRS152+1.p',unknown),
[] ).
cnf(12,axiom,
( xsd_string(u)
| xsd_integer(u) ),
file('KRS152+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cTEST(u)
| cC12(u) ),
file('KRS152+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ xsd_integer(u)
| ~ xsd_string(u) ),
file('KRS152+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ cC4(u)
| ~ cC2(u)
| cC10(u) ),
file('KRS152+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ xsd_string(skc5)
| ~ cowlThing(skc3)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081)
| xsd_integer(skc5)
| cowlNothing(skc4) ),
file('KRS152+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ xsd_integer(skc5)
| ~ cowlThing(skc3)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081)
| xsd_string(skc5)
| cowlNothing(skc4) ),
file('KRS152+1.p',unknown),
[] ).
cnf(31,plain,
( ~ cC10(iV21081)
| ~ cC12(iV21080)
| xsd_integer(skc5) ),
inference(mrr,[status(thm)],[29,12,1,7]),
[iquote('0:MRR:29.0,29.1,29.2,29.5,29.7,12.1,1.0,1.0,1.0,7.0')] ).
cnf(32,plain,
( ~ cC10(iV21081)
| ~ cC12(iV21080)
| xsd_string(skc5) ),
inference(mrr,[status(thm)],[30,31,1,7]),
[iquote('0:MRR:30.0,30.1,30.2,30.5,30.7,31.2,1.0,1.0,1.0,7.0')] ).
cnf(66,plain,
( ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081) ),
inference(ems,[status(thm)],[17,31,32]),
[iquote('0:EmS:17.0,17.1,31.2,32.2')] ).
cnf(68,plain,
( ~ cC12(iV21080)
| ~ cC10(iV21081) ),
inference(obv,[status(thm),theory(equality)],[66]),
[iquote('0:Obv:66.1')] ).
cnf(69,plain,
( ~ cTEST(iV21080)
| ~ cC10(iV21081) ),
inference(res,[status(thm),theory(equality)],[16,68]),
[iquote('0:Res:16.1,68.0')] ).
cnf(70,plain,
~ cC10(iV21081),
inference(ssi,[status(thm)],[69,2]),
[iquote('0:SSi:69.0,2.0')] ).
cnf(71,plain,
( ~ cC4(iV21081)
| ~ cC2(iV21081) ),
inference(res,[status(thm),theory(equality)],[26,70]),
[iquote('0:Res:26.2,70.0')] ).
cnf(72,plain,
$false,
inference(ssi,[status(thm)],[71,6,5]),
[iquote('0:SSi:71.1,71.0,6.0,5.0,6.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS152+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n021.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 : Tue Jun 7 09:01:36 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/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 37 clauses.
% 0.18/0.44 SPASS allocated 98076 KBytes.
% 0.18/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.44 0:00:00.03 for the input.
% 0.18/0.44 0:00:00.04 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 19 :
% 0.18/0.44 % SZS output start Refutation
% See solution above
% 0.18/0.44 Formulae used in the proof : axiom_0 axiom_7 axiom_14 axiom_15 axiom_1 axiom_6 axiom_2 the_axiom
% 0.18/0.44
%------------------------------------------------------------------------------