TSTP Solution File: KRS163+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:45 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 11 unt; 5 nHn; 18 RR)
% Number of literals : 35 ( 0 equ; 14 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 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('KRS163+1.p',unknown),
[] ).
cnf(2,axiom,
cA(ia),
file('KRS163+1.p',unknown),
[] ).
cnf(4,axiom,
cB(ib),
file('KRS163+1.p',unknown),
[] ).
cnf(6,axiom,
~ cowlNothing(u),
file('KRS163+1.p',unknown),
[] ).
cnf(7,axiom,
( xsd_string(u)
| xsd_integer(u) ),
file('KRS163+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ xsd_integer(u)
| ~ xsd_string(u) ),
file('KRS163+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cA(u)
| ~ cB(u) ),
file('KRS163+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ xsd_integer(skc5)
| ~ cowlThing(skc3)
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| xsd_string(skc5)
| cowlNothing(skc4)
| equal(ib,ia) ),
file('KRS163+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ xsd_string(skc5)
| ~ cowlThing(skc3)
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| xsd_integer(skc5)
| cowlNothing(skc4)
| equal(ib,ia) ),
file('KRS163+1.p',unknown),
[] ).
cnf(12,plain,
( xsd_integer(skc5)
| equal(ib,ia) ),
inference(mrr,[status(thm)],[11,7,1,6]),
[iquote('0:MRR:11.0,11.1,11.2,11.3,11.5,7.1,1.0,1.0,1.0,6.0')] ).
cnf(13,plain,
( xsd_string(skc5)
| equal(ib,ia) ),
inference(mrr,[status(thm)],[10,12,1,6]),
[iquote('0:MRR:10.0,10.1,10.2,10.3,10.5,12.0,1.0,1.0,1.0,6.0')] ).
cnf(14,plain,
equal(ib,ia),
inference(spt,[spt(split,[position(s1)])],[12]),
[iquote('1:Spt:12.1')] ).
cnf(15,plain,
cB(ia),
inference(rew,[status(thm),theory(equality)],[14,4]),
[iquote('1:Rew:14.0,4.0')] ).
cnf(17,plain,
$false,
inference(ems,[status(thm)],[9,2,15]),
[iquote('1:EmS:9.0,9.1,2.0,15.0')] ).
cnf(18,plain,
~ equal(ib,ia),
inference(spt,[spt(split,[position(sa)])],[17,14]),
[iquote('1:Spt:17.0,12.1,14.0')] ).
cnf(19,plain,
xsd_integer(skc5),
inference(spt,[spt(split,[position(s2)])],[12]),
[iquote('1:Spt:17.0,12.0')] ).
cnf(20,plain,
xsd_string(skc5),
inference(mrr,[status(thm)],[13,18]),
[iquote('1:MRR:13.1,18.0')] ).
cnf(21,plain,
$false,
inference(ems,[status(thm)],[8,19,20]),
[iquote('1:EmS:8.0,8.1,19.0,20.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 16:32:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 6 clauses, backtracked 4 clauses, performed 1 splits and kept 17 clauses.
% 0.20/0.44 SPASS allocated 97797 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 2, length 18 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : axiom_0 axiom_2 axiom_4 axiom_1 axiom_6 the_axiom
% 0.20/0.44
%------------------------------------------------------------------------------