TSTP Solution File: KRS166+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 23 ( 11 unt; 6 nHn; 23 RR)
% Number of literals : 43 ( 0 equ; 19 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 2 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
cowlThing(u),
file('KRS166+1.p',unknown),
[] ).
cnf(2,axiom,
~ cowlNothing(u),
file('KRS166+1.p',unknown),
[] ).
cnf(3,axiom,
( xsd_string(u)
| xsd_integer(u) ),
file('KRS166+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ cAutomobile(u)
| cCar(u) ),
file('KRS166+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ cCar(u)
| cAutomobile(u) ),
file('KRS166+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ xsd_integer(skc7)
| xsd_string(skc7)
| skC0 ),
file('KRS166+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ xsd_string(skc7)
| xsd_integer(skc7)
| skC0 ),
file('KRS166+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ xsd_integer(u)
| ~ xsd_string(u) ),
file('KRS166+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cowlThing(skc4)
| ~ skC0
| cCar(skc6)
| cAutomobile(skc6)
| cowlNothing(skc5) ),
file('KRS166+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cCar(skc6)
| ~ cAutomobile(skc6)
| ~ cowlThing(skc4)
| ~ skC0
| cowlNothing(skc5) ),
file('KRS166+1.p',unknown),
[] ).
cnf(11,plain,
( skC0
| xsd_integer(skc7) ),
inference(mrr,[status(thm)],[7,3]),
[iquote('0:MRR:7.0,3.1')] ).
cnf(12,plain,
( skC0
| xsd_string(skc7) ),
inference(mrr,[status(thm)],[6,11]),
[iquote('0:MRR:6.0,11.0')] ).
cnf(13,plain,
( ~ skC0
| cAutomobile(skc6) ),
inference(mrr,[status(thm)],[9,1,5,2]),
[iquote('0:MRR:9.0,9.2,9.4,1.0,5.0,2.0')] ).
cnf(14,plain,
( ~ skC0
| ~ cCar(skc6) ),
inference(mrr,[status(thm)],[10,13,1,2]),
[iquote('0:MRR:10.1,10.2,10.4,13.1,1.0,2.0')] ).
cnf(23,plain,
skC0,
inference(spt,[spt(split,[position(s1)])],[11]),
[iquote('1:Spt:11.0')] ).
cnf(24,plain,
cAutomobile(skc6),
inference(mrr,[status(thm)],[13,23]),
[iquote('1:MRR:13.0,23.0')] ).
cnf(25,plain,
~ cCar(skc6),
inference(mrr,[status(thm)],[14,23]),
[iquote('1:MRR:14.0,23.0')] ).
cnf(26,plain,
~ cAutomobile(skc6),
inference(res,[status(thm),theory(equality)],[4,25]),
[iquote('1:Res:4.1,25.0')] ).
cnf(27,plain,
$false,
inference(ssi,[status(thm)],[26,24]),
[iquote('1:SSi:26.0,24.0')] ).
cnf(28,plain,
~ skC0,
inference(spt,[spt(split,[position(sa)])],[27,23]),
[iquote('1:Spt:27.0,11.0,23.0')] ).
cnf(29,plain,
xsd_integer(skc7),
inference(spt,[spt(split,[position(s2)])],[11]),
[iquote('1:Spt:27.0,11.1')] ).
cnf(30,plain,
xsd_string(skc7),
inference(mrr,[status(thm)],[12,28]),
[iquote('1:MRR:12.0,28.0')] ).
cnf(31,plain,
$false,
inference(ems,[status(thm)],[8,29,30]),
[iquote('1:EmS:8.0,8.1,29.0,30.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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 19:36:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43
% 0.18/0.43 SPASS V 3.9
% 0.18/0.43 SPASS beiseite: Proof found.
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43 SPASS derived 6 clauses, backtracked 5 clauses, performed 1 splits and kept 17 clauses.
% 0.18/0.43 SPASS allocated 97765 KBytes.
% 0.18/0.43 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.43 0:00:00.04 for the input.
% 0.18/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43 0:00:00.00 for inferences.
% 0.18/0.43 0:00:00.00 for the backtracking.
% 0.18/0.43 0:00:00.00 for the reduction.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Here is a proof with depth 2, length 23 :
% 0.18/0.43 % SZS output start Refutation
% See solution above
% 0.18/0.43 Formulae used in the proof : axiom_0 axiom_1 axiom_2 axiom_3 the_axiom
% 0.18/0.43
%------------------------------------------------------------------------------