↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN107-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 : n005.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:19 AM UTC 2026

% Result   : Unsatisfiable 16.86s 2.82s
% Output   : CNFRefutation 16.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   7 unt;   0 nHn;   7 RR)
%            Number of literals    :   15 (   0 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   18 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ k2(X0,d) ).

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

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

cnf(rule_129,axiom,
    ( ~ q1(X1,X0,X0)
    | k2(X0,X0) ) ).

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

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

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

cnf(c167,plain,
    ( ~ q1(X1,X0,X0)
    | k2(X0,X0) ),
    inference(clausification,[status(esa)],[rule_129]) ).

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

cnf(d1,plain,
    k2(X0,X0),
    inference(resolution,[status(thm)],[c167,d0]) ).

cnf(d2,plain,
    $false,
    inference(resolution,[status(thm)],[d1,c0]) ).

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