↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN208-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 09:21:33 AM UTC 2026

% Result   : Unsatisfiable 10.25s 2.92s
% Output   : CNFRefutation 10.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   41 (  19 unt;   0 nHn;  28 RR)
%            Number of literals    :   77 (   0 equ;  39 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   55 (  26 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ s3(d,b) ).

cnf(axiom_1,axiom,
    s0(d) ).

cnf(axiom_14,axiom,
    p0(b,X0) ).

cnf(axiom_17,axiom,
    q0(X0,d) ).

cnf(axiom_19,axiom,
    m0(X0,d,X1) ).

cnf(rule_085,axiom,
    ( ~ p0(X1,X0)
    | p1(X0,X0,X0) ) ).

cnf(rule_110,axiom,
    ( ~ m0(X1,X2,X0)
    | q1(X0,X0,X0) ) ).

cnf(rule_124,axiom,
    ( ~ q1(d,X1,d)
    | ~ s0(d)
    | ~ q0(X0,X1)
    | r1(X0) ) ).

cnf(rule_125,axiom,
    ( ~ p0(X0,X0)
    | s1(X0) ) ).

cnf(rule_126,axiom,
    ( ~ s1(X2)
    | ~ q0(X0,X1)
    | s1(X0) ) ).

cnf(rule_181,axiom,
    ( ~ p1(X0,X0,X0)
    | q2(X0,X0,X0) ) ).

cnf(rule_191,axiom,
    ( ~ s1(d)
    | ~ r1(d)
    | s2(d) ) ).

cnf(rule_273,axiom,
    ( ~ m0(X2,X3,X1)
    | ~ s2(X0)
    | ~ q2(X2,X0,X2)
    | s3(X0,X1) ) ).

cnf(c0,plain,
    ~ s3(d,b),
    inference(clausification,[status(esa)],[prove_this]) ).

cnf(c1,plain,
    s0(d),
    inference(clausification,[status(esa)],[axiom_1]) ).

cnf(c14,plain,
    p0(b,X0),
    inference(clausification,[status(esa)],[axiom_14]) ).

cnf(c17,plain,
    q0(X0,d),
    inference(clausification,[status(esa)],[axiom_17]) ).

cnf(c19,plain,
    m0(X0,d,X1),
    inference(clausification,[status(esa)],[axiom_19]) ).

cnf(c123,plain,
    ( ~ p0(X1,X0)
    | p1(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_085]) ).

cnf(c148,plain,
    ( ~ m0(X1,X2,X0)
    | q1(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_110]) ).

cnf(c162,plain,
    ( ~ q1(d,X1,d)
    | ~ s0(d)
    | ~ q0(X0,X1)
    | r1(X0) ),
    inference(clausification,[status(esa)],[rule_124]) ).

cnf(c163,plain,
    ( ~ p0(X0,X0)
    | s1(X0) ),
    inference(clausification,[status(esa)],[rule_125]) ).

cnf(c164,plain,
    ( ~ s1(X2)
    | ~ q0(X0,X1)
    | s1(X0) ),
    inference(clausification,[status(esa)],[rule_126]) ).

cnf(c219,plain,
    ( ~ p1(X0,X0,X0)
    | q2(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_181]) ).

cnf(c229,plain,
    ( ~ s1(d)
    | ~ r1(d)
    | s2(d) ),
    inference(clausification,[status(esa)],[rule_191]) ).

cnf(c311,plain,
    ( ~ m0(X2,X3,X1)
    | ~ s2(X0)
    | ~ q2(X2,X0,X2)
    | s3(X0,X1) ),
    inference(clausification,[status(esa)],[rule_273]) ).

cnf(d0,plain,
    p1(X0,X0,X0),
    inference(resolution,[status(thm)],[c123,c14]) ).

cnf(d1,plain,
    q2(X0,X0,X0),
    inference(resolution,[status(thm)],[d0,c219]) ).

cnf(d2,plain,
    ( ~ s2(X0)
    | ~ m0(X0,X2,X1)
    | s3(X0,X1) ),
    inference(resolution,[status(thm)],[c311,d1]) ).

cnf(d3,plain,
    ( ~ s2(X0)
    | s3(X0,X1) ),
    inference(resolution,[status(thm)],[d2,c19]) ).

cnf(d4,plain,
    ~ s2(d),
    inference(resolution,[status(thm)],[d3,c0]) ).

cnf(d5,plain,
    s1(b),
    inference(resolution,[status(thm)],[c163,c14]) ).

cnf(d6,plain,
    ( ~ s1(X1)
    | s1(X0) ),
    inference(resolution,[status(thm)],[c164,c17]) ).

cnf(d7,plain,
    s1(X0),
    inference(resolution,[status(thm)],[d6,d5]) ).

cnf(d8,plain,
    ( s2(d)
    | ~ r1(d) ),
    inference(resolution,[status(thm)],[d7,c229]) ).

cnf(d9,plain,
    q1(X0,X0,X0),
    inference(resolution,[status(thm)],[c148,c19]) ).

cnf(d10,plain,
    ( r1(X0)
    | ~ q1(d,X1,d)
    | ~ q0(X0,X1) ),
    inference(resolution,[status(thm)],[c1,c162]) ).

cnf(d11,plain,
    ( r1(X0)
    | ~ q0(X0,d) ),
    inference(resolution,[status(thm)],[d10,d9]) ).

cnf(d12,plain,
    r1(X0),
    inference(resolution,[status(thm)],[c17,d11]) ).

cnf(d13,plain,
    s2(d),
    inference(resolution,[status(thm)],[d12,d8]) ).

cnf(d14,plain,
    $false,
    inference(resolution,[status(thm)],[d13,d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN208-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n010.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 17:22:15 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.25/2.92  % SZS status Unsatisfiable for theBenchmark.p
% 10.25/2.92  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------