TSTP Solution File: KRS135+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS135+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:40 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 9 unt; 4 nHn; 20 RR)
% Number of literals : 37 ( 0 equ; 18 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(1,axiom,
cowlThing(u),
file('KRS135+1.p',unknown),
[] ).
cnf(2,axiom,
~ cowlNothing(u),
file('KRS135+1.p',unknown),
[] ).
cnf(3,axiom,
( xsd_string(u)
| xsd_integer(u) ),
file('KRS135+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ xsd_integer(skc9)
| xsd_string(skc9) ),
file('KRS135+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ xsd_string(skc9)
| xsd_integer(skc9)
| skC0 ),
file('KRS135+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ xsd_integer(u)
| ~ xsd_string(u) ),
file('KRS135+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ cowlThing(u)
| ~ rprop(u,v)
| cA(v) ),
file('KRS135+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cowlThing(skc5)
| ~ skC0
| rprop(skc8,skc7)
| cowlNothing(skc6) ),
file('KRS135+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cA(skc7)
| ~ cowlThing(skc5)
| ~ skC0
| cowlNothing(skc6) ),
file('KRS135+1.p',unknown),
[] ).
cnf(10,plain,
xsd_string(skc9),
inference(mrr,[status(thm)],[4,3]),
[iquote('0:MRR:4.0,3.0')] ).
cnf(11,plain,
( xsd_integer(skc9)
| skC0 ),
inference(mrr,[status(thm)],[5,10]),
[iquote('0:MRR:5.0,10.0')] ).
cnf(12,plain,
( ~ rprop(u,v)
| cA(v) ),
inference(mrr,[status(thm)],[7,1]),
[iquote('0:MRR:7.0,1.0')] ).
cnf(13,plain,
( ~ cA(skc7)
| ~ skC0 ),
inference(mrr,[status(thm)],[9,1,2]),
[iquote('0:MRR:9.1,9.3,1.0,2.0')] ).
cnf(14,plain,
( ~ skC0
| rprop(skc8,skc7) ),
inference(mrr,[status(thm)],[8,1,2]),
[iquote('0:MRR:8.0,8.3,1.0,2.0')] ).
cnf(15,plain,
~ xsd_integer(skc9),
inference(res,[status(thm),theory(equality)],[10,6]),
[iquote('0:Res:10.0,6.0')] ).
cnf(16,plain,
skC0,
inference(mrr,[status(thm)],[11,15]),
[iquote('0:MRR:11.0,15.0')] ).
cnf(17,plain,
~ cA(skc7),
inference(mrr,[status(thm)],[13,16]),
[iquote('0:MRR:13.1,16.0')] ).
cnf(18,plain,
rprop(skc8,skc7),
inference(mrr,[status(thm)],[14,16]),
[iquote('0:MRR:14.0,16.0')] ).
cnf(26,plain,
cA(skc7),
inference(res,[status(thm),theory(equality)],[18,12]),
[iquote('0:Res:18.0,12.0')] ).
cnf(27,plain,
$false,
inference(mrr,[status(thm)],[26,17]),
[iquote('0:MRR:26.0,17.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS135+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 18:29:04 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/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.19/0.43 SPASS allocated 97629 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 1, length 20 :
% 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
%------------------------------------------------------------------------------