TSTP Solution File: SWV009-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:40:55 EDT 2022
% Result : Unsatisfiable 0.14s 0.43s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 9 unt; 1 nHn; 16 RR)
% Number of literals : 34 ( 0 equ; 23 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 : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( less(u,v)
| less_or_equal(v,u) ),
file('SWV009-1.p',unknown),
[] ).
cnf(3,axiom,
less_or_equal(m,p),
file('SWV009-1.p',unknown),
[] ).
cnf(4,axiom,
less_or_equal(p,q),
file('SWV009-1.p',unknown),
[] ).
cnf(5,axiom,
less_or_equal(q,n),
file('SWV009-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ less_or_equal(u,n)
| ~ less(v,i)
| ~ less(j,u)
| ~ less_or_equal(m,v)
| less_or_equal(a(v),a(u)) ),
file('SWV009-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ less_or_equal(u,v)
| ~ less_or_equal(v,j)
| ~ less_or_equal(m,u)
| less_or_equal(a(u),a(v)) ),
file('SWV009-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ less_or_equal(u,v)
| ~ less_or_equal(v,n)
| ~ less_or_equal(i,u)
| less_or_equal(a(u),a(v)) ),
file('SWV009-1.p',unknown),
[] ).
cnf(9,axiom,
~ less_or_equal(a(p),a(q)),
file('SWV009-1.p',unknown),
[] ).
cnf(11,plain,
( ~ less_or_equal(p,q)
| ~ less_or_equal(q,n)
| ~ less_or_equal(i,p) ),
inference(res,[status(thm),theory(equality)],[8,9]),
[iquote('0:Res:8.3,9.0')] ).
cnf(12,plain,
~ less_or_equal(i,p),
inference(mrr,[status(thm)],[11,4,5]),
[iquote('0:MRR:11.0,11.1,4.0,5.0')] ).
cnf(13,plain,
less(p,i),
inference(res,[status(thm),theory(equality)],[1,12]),
[iquote('0:Res:1.1,12.0')] ).
cnf(14,plain,
( ~ less_or_equal(p,q)
| ~ less_or_equal(q,j)
| ~ less_or_equal(m,p) ),
inference(res,[status(thm),theory(equality)],[7,9]),
[iquote('0:Res:7.3,9.0')] ).
cnf(15,plain,
~ less_or_equal(q,j),
inference(mrr,[status(thm)],[14,4,3]),
[iquote('0:MRR:14.0,14.2,4.0,3.0')] ).
cnf(16,plain,
less(j,q),
inference(res,[status(thm),theory(equality)],[1,15]),
[iquote('0:Res:1.1,15.0')] ).
cnf(17,plain,
( ~ less_or_equal(q,n)
| ~ less(p,i)
| ~ less(j,q)
| ~ less_or_equal(m,p) ),
inference(res,[status(thm),theory(equality)],[6,9]),
[iquote('0:Res:6.4,9.0')] ).
cnf(18,plain,
$false,
inference(mrr,[status(thm)],[17,5,13,16,3]),
[iquote('0:MRR:17.0,17.1,17.2,17.3,5.0,13.0,16.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.14/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 00:29:50 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.43
% 0.14/0.43 SPASS V 3.9
% 0.14/0.43 SPASS beiseite: Proof found.
% 0.14/0.43 % SZS status Theorem
% 0.14/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.43 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 15 clauses.
% 0.14/0.43 SPASS allocated 63091 KBytes.
% 0.14/0.43 SPASS spent 0:00:00.06 on the problem.
% 0.14/0.43 0:00:00.03 for the input.
% 0.14/0.43 0:00:00.00 for the FLOTTER CNF translation.
% 0.14/0.43 0:00:00.00 for inferences.
% 0.14/0.43 0:00:00.00 for the backtracking.
% 0.14/0.43 0:00:00.00 for the reduction.
% 0.14/0.43
% 0.14/0.43
% 0.14/0.43 Here is a proof with depth 2, length 16 :
% 0.14/0.43 % SZS output start Refutation
% See solution above
% 0.14/0.43 Formulae used in the proof : clause_1 clause_3 clause_4 clause_5 clause_6 clause_7 clause_8 clause_9
% 0.14/0.43
%------------------------------------------------------------------------------