TSTP Solution File: KRS170+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS170+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:46 EDT 2022
% Result : Theorem 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 17 unt; 7 nHn; 33 RR)
% Number of literals : 59 ( 0 equ; 27 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
cowlThing(u),
file('KRS170+1.p',unknown),
[] ).
cnf(2,axiom,
~ cowlNothing(u),
file('KRS170+1.p',unknown),
[] ).
cnf(3,axiom,
( skC1
| rhasLeader(skc13,skc12) ),
file('KRS170+1.p',unknown),
[] ).
cnf(4,axiom,
( xsd_string(u)
| xsd_integer(u) ),
file('KRS170+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ rhasHead(skc13,skc12)
| skC1 ),
file('KRS170+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ xsd_integer(skc11)
| xsd_string(skc11)
| skC0 ),
file('KRS170+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ xsd_string(skc11)
| xsd_integer(skc11)
| skC0 ),
file('KRS170+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ xsd_integer(u)
| ~ xsd_string(u) ),
file('KRS170+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ rhasLeader(u,v)
| rhasHead(u,v) ),
file('KRS170+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ rhasHead(u,v)
| rhasLeader(u,v) ),
file('KRS170+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cowlThing(skc7)
| ~ skC0
| ~ skC1
| rhasHead(skc10,skc9)
| cowlNothing(skc8) ),
file('KRS170+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ rhasLeader(skc10,skc9)
| ~ cowlThing(skc7)
| ~ skC0
| ~ skC1
| cowlNothing(skc8) ),
file('KRS170+1.p',unknown),
[] ).
cnf(13,plain,
( skC0
| xsd_integer(skc11) ),
inference(mrr,[status(thm)],[7,4]),
[iquote('0:MRR:7.0,4.1')] ).
cnf(14,plain,
( skC0
| xsd_string(skc11) ),
inference(mrr,[status(thm)],[6,13]),
[iquote('0:MRR:6.0,13.0')] ).
cnf(15,plain,
( ~ skC1
| ~ skC0
| rhasHead(skc10,skc9) ),
inference(mrr,[status(thm)],[11,1,2]),
[iquote('0:MRR:11.0,11.4,1.0,2.0')] ).
cnf(16,plain,
( ~ skC1
| ~ skC0
| ~ rhasLeader(skc10,skc9) ),
inference(mrr,[status(thm)],[12,1,2]),
[iquote('0:MRR:12.1,12.4,1.0,2.0')] ).
cnf(22,plain,
~ skC1,
inference(spt,[spt(split,[position(s1)])],[15]),
[iquote('1:Spt:15.0')] ).
cnf(23,plain,
rhasLeader(skc13,skc12),
inference(mrr,[status(thm)],[3,22]),
[iquote('1:MRR:3.0,22.0')] ).
cnf(24,plain,
~ rhasHead(skc13,skc12),
inference(mrr,[status(thm)],[5,22]),
[iquote('1:MRR:5.1,22.0')] ).
cnf(26,plain,
rhasHead(skc13,skc12),
inference(res,[status(thm),theory(equality)],[23,9]),
[iquote('1:Res:23.0,9.0')] ).
cnf(27,plain,
$false,
inference(mrr,[status(thm)],[26,24]),
[iquote('1:MRR:26.0,24.0')] ).
cnf(28,plain,
skC1,
inference(spt,[spt(split,[position(sa)])],[27,22]),
[iquote('1:Spt:27.0,15.0,22.0')] ).
cnf(29,plain,
( ~ skC0
| rhasHead(skc10,skc9) ),
inference(spt,[spt(split,[position(s2)])],[15]),
[iquote('1:Spt:27.0,15.1,15.2')] ).
cnf(30,plain,
( ~ skC0
| ~ rhasLeader(skc10,skc9) ),
inference(mrr,[status(thm)],[16,28]),
[iquote('1:MRR:16.0,28.0')] ).
cnf(31,plain,
skC0,
inference(spt,[spt(split,[position(s2s1)])],[14]),
[iquote('2:Spt:14.0')] ).
cnf(32,plain,
rhasHead(skc10,skc9),
inference(mrr,[status(thm)],[29,31]),
[iquote('2:MRR:29.0,31.0')] ).
cnf(33,plain,
~ rhasLeader(skc10,skc9),
inference(mrr,[status(thm)],[30,31]),
[iquote('2:MRR:30.0,31.0')] ).
cnf(34,plain,
rhasLeader(skc10,skc9),
inference(res,[status(thm),theory(equality)],[32,10]),
[iquote('2:Res:32.0,10.0')] ).
cnf(35,plain,
$false,
inference(mrr,[status(thm)],[34,33]),
[iquote('2:MRR:34.0,33.0')] ).
cnf(36,plain,
~ skC0,
inference(spt,[spt(split,[position(s2sa)])],[35,31]),
[iquote('2:Spt:35.0,14.0,31.0')] ).
cnf(37,plain,
xsd_string(skc11),
inference(spt,[spt(split,[position(s2s2)])],[14]),
[iquote('2:Spt:35.0,14.1')] ).
cnf(38,plain,
xsd_integer(skc11),
inference(mrr,[status(thm)],[13,36]),
[iquote('2:MRR:13.0,36.0')] ).
cnf(40,plain,
$false,
inference(ems,[status(thm)],[8,38,37]),
[iquote('2:EmS:8.0,8.1,38.0,37.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS170+1 : TPTP v8.1.0. Released v3.1.0.
% 0.14/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n019.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 7 15:05:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.44
% 0.21/0.44 SPASS V 3.9
% 0.21/0.44 SPASS beiseite: Proof found.
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44 SPASS derived 11 clauses, backtracked 12 clauses, performed 3 splits and kept 29 clauses.
% 0.21/0.44 SPASS allocated 97858 KBytes.
% 0.21/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.44 0:00:00.03 for the input.
% 0.21/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.44 0:00:00.00 for inferences.
% 0.21/0.44 0:00:00.00 for the backtracking.
% 0.21/0.44 0:00:00.00 for the reduction.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Here is a proof with depth 2, length 33 :
% 0.21/0.44 % SZS output start Refutation
% See solution above
% 0.21/0.44 Formulae used in the proof : axiom_0 the_axiom axiom_1 axiom_2
% 0.21/0.44
%------------------------------------------------------------------------------