TSTP Solution File: SWV009-1 by PyRes---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SWV009-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n032.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  : 300s
% DateTime : Thu May  9 17:44:05 EDT 2024

% Result   : Unsatisfiable 0.14s 0.47s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (   8 unt;   5 nHn;  20 RR)
%            Number of literals    :   48 (   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    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_9,negated_conjecture,
    ~ less_or_equal(a(p),a(q)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

cnf(clause_3,negated_conjecture,
    less_or_equal(m,p),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_1,negated_conjecture,
    ( less_or_equal(X2,X3)
    | less(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_4,negated_conjecture,
    less_or_equal(p,q),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_5,negated_conjecture,
    less_or_equal(q,n),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_8,negated_conjecture,
    ( ~ less_or_equal(i,X8)
    | ~ less_or_equal(X8,X9)
    | ~ less_or_equal(X9,n)
    | less_or_equal(a(X8),a(X9)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

cnf(c9,plain,
    ( ~ less_or_equal(i,X10)
    | ~ less_or_equal(X10,q)
    | less_or_equal(a(X10),a(q)) ),
    inference(resolution,[status(thm)],[clause_8,clause_5]) ).

cnf(c11,plain,
    ( ~ less_or_equal(i,p)
    | less_or_equal(a(p),a(q)) ),
    inference(resolution,[status(thm)],[c9,clause_4]) ).

cnf(c14,plain,
    ( less_or_equal(a(p),a(q))
    | less(p,i) ),
    inference(resolution,[status(thm)],[c11,clause_1]) ).

cnf(c15,plain,
    less(p,i),
    inference(resolution,[status(thm)],[c14,clause_9]) ).

cnf(clause_6,negated_conjecture,
    ( ~ less_or_equal(m,X4)
    | ~ less(X4,i)
    | ~ less(j,X5)
    | ~ less_or_equal(X5,n)
    | less_or_equal(a(X4),a(X5)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(c1,plain,
    ( ~ less_or_equal(m,X13)
    | ~ less(X13,i)
    | ~ less(j,q)
    | less_or_equal(a(X13),a(q)) ),
    inference(resolution,[status(thm)],[clause_6,clause_5]) ).

cnf(clause_7,negated_conjecture,
    ( ~ less_or_equal(m,X6)
    | ~ less_or_equal(X6,X7)
    | ~ less_or_equal(X7,j)
    | less_or_equal(a(X6),a(X7)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

cnf(c6,plain,
    ( ~ less_or_equal(m,X14)
    | ~ less_or_equal(X14,X15)
    | less_or_equal(a(X14),a(X15))
    | less(j,X15) ),
    inference(resolution,[status(thm)],[clause_7,clause_1]) ).

cnf(c23,plain,
    ( ~ less_or_equal(m,p)
    | less_or_equal(a(p),a(q))
    | less(j,q) ),
    inference(resolution,[status(thm)],[c6,clause_4]) ).

cnf(c56,plain,
    ( less_or_equal(a(p),a(q))
    | less(j,q) ),
    inference(resolution,[status(thm)],[c23,clause_3]) ).

cnf(c58,plain,
    less(j,q),
    inference(resolution,[status(thm)],[c56,clause_9]) ).

cnf(c69,plain,
    ( ~ less_or_equal(m,X24)
    | ~ less(X24,i)
    | less_or_equal(a(X24),a(q)) ),
    inference(resolution,[status(thm)],[c58,c1]) ).

cnf(c72,plain,
    ( ~ less_or_equal(m,p)
    | less_or_equal(a(p),a(q)) ),
    inference(resolution,[status(thm)],[c69,c15]) ).

cnf(c78,plain,
    less_or_equal(a(p),a(q)),
    inference(resolution,[status(thm)],[c72,clause_3]) ).

cnf(c80,plain,
    $false,
    inference(resolution,[status(thm)],[c78,clause_9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : SWV009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.10  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 300
% 0.10/0.29  % DateTime : Thu May  9 06:26:52 EDT 2024
% 0.10/0.29  % CPUTime  : 
% 0.14/0.47  % Version:  1.5
% 0.14/0.47  % SZS status Unsatisfiable
% 0.14/0.47  % SZS output start CNFRefutation
% See solution above
% 0.14/0.47  
% 0.14/0.47  % Initial clauses    : 9
% 0.14/0.47  % Processed clauses  : 41
% 0.14/0.47  % Factors computed   : 8
% 0.14/0.47  % Resolvents computed: 75
% 0.14/0.47  % Tautologies deleted: 0
% 0.14/0.47  % Forward subsumed   : 1
% 0.14/0.47  % Backward subsumed  : 8
% 0.14/0.47  % -------- CPU Time ---------
% 0.14/0.47  % User time          : 0.163 s
% 0.14/0.47  % System time        : 0.013 s
% 0.14/0.47  % Total time         : 0.176 s
%------------------------------------------------------------------------------