TSTP Solution File: SWV009-1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n007.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 20:29:48 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 9 unt; 7 nHn; 27 RR)
% Number of literals : 74 ( 0 equ; 41 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 : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
( less_or_equal(X,Y)
| less(Y,X) ) ).
cnf(clause_3,negated_conjecture,
less_or_equal(m,p) ).
cnf(clause_4,negated_conjecture,
less_or_equal(p,q) ).
cnf(clause_5,negated_conjecture,
less_or_equal(q,n) ).
cnf(clause_6,negated_conjecture,
( ~ less_or_equal(m,X)
| ~ less(X,i)
| ~ less(j,Y)
| ~ less_or_equal(Y,n)
| less_or_equal(a(X),a(Y)) ) ).
cnf(clause_7,negated_conjecture,
( ~ less_or_equal(m,X)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,j)
| less_or_equal(a(X),a(Y)) ) ).
cnf(clause_8,negated_conjecture,
( ~ less_or_equal(i,X)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,n)
| less_or_equal(a(X),a(Y)) ) ).
cnf(clause_9,negated_conjecture,
~ less_or_equal(a(p),a(q)) ).
cnf(refute_0_0,plain,
( less(j,X_3)
| less_or_equal(X_3,j) ),
inference(subst,[],[clause_1:[bind(X,$fot(X_3)),bind(Y,$fot(j))]]) ).
cnf(refute_0_1,plain,
( ~ less_or_equal(X_2,X_3)
| ~ less_or_equal(X_3,j)
| ~ less_or_equal(m,X_2)
| less_or_equal(a(X_2),a(X_3)) ),
inference(subst,[],[clause_7:[bind(X,$fot(X_2)),bind(Y,$fot(X_3))]]) ).
cnf(refute_0_2,plain,
( ~ less_or_equal(X_2,X_3)
| ~ less_or_equal(m,X_2)
| less(j,X_3)
| less_or_equal(a(X_2),a(X_3)) ),
inference(resolve,[$cnf( less_or_equal(X_3,j) )],[refute_0_0,refute_0_1]) ).
cnf(refute_0_3,plain,
( ~ less_or_equal(m,p)
| ~ less_or_equal(p,q)
| less(j,q)
| less_or_equal(a(p),a(q)) ),
inference(subst,[],[refute_0_2:[bind(X_2,$fot(p)),bind(X_3,$fot(q))]]) ).
cnf(refute_0_4,plain,
( ~ less_or_equal(m,p)
| less(j,q)
| less_or_equal(a(p),a(q)) ),
inference(resolve,[$cnf( less_or_equal(p,q) )],[clause_4,refute_0_3]) ).
cnf(refute_0_5,plain,
( less(j,q)
| less_or_equal(a(p),a(q)) ),
inference(resolve,[$cnf( less_or_equal(m,p) )],[clause_3,refute_0_4]) ).
cnf(refute_0_6,plain,
( ~ less(j,X_11)
| ~ less(p,i)
| ~ less_or_equal(X_11,n)
| ~ less_or_equal(m,p)
| less_or_equal(a(p),a(X_11)) ),
inference(subst,[],[clause_6:[bind(X,$fot(p)),bind(Y,$fot(X_11))]]) ).
cnf(refute_0_7,plain,
( ~ less(j,X_11)
| ~ less(p,i)
| ~ less_or_equal(X_11,n)
| less_or_equal(a(p),a(X_11)) ),
inference(resolve,[$cnf( less_or_equal(m,p) )],[clause_3,refute_0_6]) ).
cnf(refute_0_8,plain,
( less(p,i)
| less_or_equal(i,p) ),
inference(subst,[],[clause_1:[bind(X,$fot(i)),bind(Y,$fot(p))]]) ).
cnf(refute_0_9,plain,
( ~ less_or_equal(X_4,q)
| ~ less_or_equal(i,X_4)
| ~ less_or_equal(q,n)
| less_or_equal(a(X_4),a(q)) ),
inference(subst,[],[clause_8:[bind(X,$fot(X_4)),bind(Y,$fot(q))]]) ).
cnf(refute_0_10,plain,
( ~ less_or_equal(X_4,q)
| ~ less_or_equal(i,X_4)
| less_or_equal(a(X_4),a(q)) ),
inference(resolve,[$cnf( less_or_equal(q,n) )],[clause_5,refute_0_9]) ).
cnf(refute_0_11,plain,
( ~ less_or_equal(i,p)
| ~ less_or_equal(p,q)
| less_or_equal(a(p),a(q)) ),
inference(subst,[],[refute_0_10:[bind(X_4,$fot(p))]]) ).
cnf(refute_0_12,plain,
( ~ less_or_equal(i,p)
| less_or_equal(a(p),a(q)) ),
inference(resolve,[$cnf( less_or_equal(p,q) )],[clause_4,refute_0_11]) ).
cnf(refute_0_13,plain,
~ less_or_equal(i,p),
inference(resolve,[$cnf( less_or_equal(a(p),a(q)) )],[refute_0_12,clause_9]) ).
cnf(refute_0_14,plain,
less(p,i),
inference(resolve,[$cnf( less_or_equal(i,p) )],[refute_0_8,refute_0_13]) ).
cnf(refute_0_15,plain,
( ~ less(j,X_11)
| ~ less_or_equal(X_11,n)
| less_or_equal(a(p),a(X_11)) ),
inference(resolve,[$cnf( less(p,i) )],[refute_0_14,refute_0_7]) ).
cnf(refute_0_16,plain,
( ~ less(j,q)
| ~ less_or_equal(q,n)
| less_or_equal(a(p),a(q)) ),
inference(subst,[],[refute_0_15:[bind(X_11,$fot(q))]]) ).
cnf(refute_0_17,plain,
( ~ less(j,q)
| less_or_equal(a(p),a(q)) ),
inference(resolve,[$cnf( less_or_equal(q,n) )],[clause_5,refute_0_16]) ).
cnf(refute_0_18,plain,
~ less(j,q),
inference(resolve,[$cnf( less_or_equal(a(p),a(q)) )],[refute_0_17,clause_9]) ).
cnf(refute_0_19,plain,
less_or_equal(a(p),a(q)),
inference(resolve,[$cnf( less(j,q) )],[refute_0_5,refute_0_18]) ).
cnf(refute_0_20,plain,
$false,
inference(resolve,[$cnf( less_or_equal(a(p),a(q)) )],[refute_0_19,clause_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : metis --show proof --show saturation %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 23:52:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.20/0.40 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40
% 0.20/0.40 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.20/0.40
%------------------------------------------------------------------------------