TSTP Solution File: SWV488+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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 : Wed Jul 20 21:43:18 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 21 ( 0 equ; 12 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
int_leq(int_one,skc1),
file('SWV488+2.p',unknown),
[] ).
cnf(2,axiom,
int_leq(skc1,skc1),
file('SWV488+2.p',unknown),
[] ).
cnf(3,axiom,
int_leq(skc1,n),
file('SWV488+2.p',unknown),
[] ).
cnf(6,axiom,
~ equal(real_one,real_zero),
file('SWV488+2.p',unknown),
[] ).
cnf(7,axiom,
equal(a(skc1,skc1),real_zero),
file('SWV488+2.p',unknown),
[] ).
cnf(21,axiom,
( ~ int_leq(u,v)
| ~ int_leq(v,n)
| ~ int_leq(int_one,v)
| ~ int_leq(int_one,u)
| equal(a(u,u),real_one) ),
file('SWV488+2.p',unknown),
[] ).
cnf(34,plain,
( ~ int_leq(int_one,skc1)
| ~ int_leq(skc1,n)
| ~ int_leq(int_one,skc1)
| equal(a(skc1,skc1),real_one) ),
inference(res,[status(thm),theory(equality)],[2,21]),
[iquote('0:Res:2.0,21.1')] ).
cnf(56,plain,
( ~ int_leq(skc1,n)
| ~ int_leq(int_one,skc1)
| equal(a(skc1,skc1),real_one) ),
inference(obv,[status(thm),theory(equality)],[34]),
[iquote('0:Obv:34.0')] ).
cnf(57,plain,
( ~ int_leq(skc1,n)
| ~ int_leq(int_one,skc1)
| equal(real_one,real_zero) ),
inference(rew,[status(thm),theory(equality)],[7,56]),
[iquote('0:Rew:7.0,56.2')] ).
cnf(58,plain,
$false,
inference(mrr,[status(thm)],[57,3,1,6]),
[iquote('0:MRR:57.0,57.1,57.2,3.0,1.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 15 14:38:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 29 clauses, backtracked 0 clauses, performed 0 splits and kept 31 clauses.
% 0.20/0.46 SPASS allocated 85348 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.20/0.46 0:00:00.03 for the input.
% 0.20/0.46 0:00:00.05 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.00 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 1, length 10 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : lti real_constants qil
% 0.20/0.46
%------------------------------------------------------------------------------