TSTP Solution File: KRS134+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS134+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:39 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 11 unt; 6 nHn; 22 RR)
% Number of literals : 39 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cowlThing(u),
file('KRS134+1.p',unknown),
[] ).
cnf(3,axiom,
~ cowlNothing(u),
file('KRS134+1.p',unknown),
[] ).
cnf(4,axiom,
( xsd_string(u)
| xsd_integer(u) ),
file('KRS134+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ xsd_integer(skc9)
| xsd_string(skc9)
| skC0 ),
file('KRS134+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ xsd_string(skc9)
| xsd_integer(skc9)
| skC0 ),
file('KRS134+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ xsd_integer(u)
| ~ xsd_string(u) ),
file('KRS134+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ rprop(u,v)
| cA(v) ),
file('KRS134+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cowlThing(skc5)
| ~ skC0
| rprop(skc7,skc8)
| cowlNothing(skc6) ),
file('KRS134+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cA(skc8)
| ~ cowlThing(skc5)
| ~ skC0
| cowlNothing(skc6) ),
file('KRS134+1.p',unknown),
[] ).
cnf(11,plain,
( skC0
| xsd_integer(skc9) ),
inference(mrr,[status(thm)],[6,4]),
[iquote('0:MRR:6.0,4.1')] ).
cnf(12,plain,
( skC0
| xsd_string(skc9) ),
inference(mrr,[status(thm)],[5,11]),
[iquote('0:MRR:5.0,11.0')] ).
cnf(13,plain,
( ~ skC0
| ~ cA(skc8) ),
inference(mrr,[status(thm)],[10,2,3]),
[iquote('0:MRR:10.1,10.3,2.0,3.0')] ).
cnf(14,plain,
( ~ skC0
| rprop(skc7,skc8) ),
inference(mrr,[status(thm)],[9,2,3]),
[iquote('0:MRR:9.0,9.3,2.0,3.0')] ).
cnf(21,plain,
skC0,
inference(spt,[spt(split,[position(s1)])],[11]),
[iquote('1:Spt:11.0')] ).
cnf(22,plain,
~ cA(skc8),
inference(mrr,[status(thm)],[13,21]),
[iquote('1:MRR:13.0,21.0')] ).
cnf(23,plain,
rprop(skc7,skc8),
inference(mrr,[status(thm)],[14,21]),
[iquote('1:MRR:14.0,21.0')] ).
cnf(24,plain,
cA(skc8),
inference(res,[status(thm),theory(equality)],[23,8]),
[iquote('1:Res:23.0,8.0')] ).
cnf(25,plain,
$false,
inference(mrr,[status(thm)],[24,22]),
[iquote('1:MRR:24.0,22.0')] ).
cnf(26,plain,
~ skC0,
inference(spt,[spt(split,[position(sa)])],[25,21]),
[iquote('1:Spt:25.0,11.0,21.0')] ).
cnf(27,plain,
xsd_integer(skc9),
inference(spt,[spt(split,[position(s2)])],[11]),
[iquote('1:Spt:25.0,11.1')] ).
cnf(28,plain,
xsd_string(skc9),
inference(mrr,[status(thm)],[12,26]),
[iquote('1:MRR:12.0,26.0')] ).
cnf(29,plain,
$false,
inference(ems,[status(thm)],[7,27,28]),
[iquote('1:EmS:7.0,7.1,27.0,28.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS134+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n023.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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 12:38:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 6 clauses, backtracked 5 clauses, performed 1 splits and kept 16 clauses.
% 0.19/0.43 SPASS allocated 97671 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.43 0:00:00.03 for the input.
% 0.19/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.00 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 2, length 22 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : axiom_0 axiom_1 the_axiom axiom_2
% 0.19/0.43
%------------------------------------------------------------------------------