↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n011.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:39 AM UTC 2026

% Result   : Unsatisfiable 8.87s 3.43s
% Output   : CNFRefutation 8.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   36 (  17 unt;   0 nHn;  34 RR)
%            Number of literals    :   76 (   0 equ;  44 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   41 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ m1(e,a,a) ).

cnf(axiom_6,axiom,
    q0(b,b) ).

cnf(axiom_12,axiom,
    m0(a,X0,a) ).

cnf(axiom_13,axiom,
    r0(e) ).

cnf(axiom_21,axiom,
    q0(b,e) ).

cnf(axiom_24,axiom,
    l0(c) ).

cnf(axiom_37,axiom,
    n0(b,a) ).

cnf(rule_001,axiom,
    ( ~ n0(X1,X0)
    | k1(X0) ) ).

cnf(rule_016,axiom,
    ( ~ m1(X2,X3,X1)
    | ~ m1(X2,X1,X0)
    | m1(X0,X1,X1) ) ).

cnf(rule_024,axiom,
    ( ~ m1(X1,c,X1)
    | ~ q0(X0,X1)
    | ~ m0(a,X2,a)
    | m1(X0,a,X1) ) ).

cnf(rule_034,axiom,
    ( ~ q0(X0,X0)
    | ~ k1(X1)
    | ~ k1(a)
    | m1(X0,X1,X1) ) ).

cnf(rule_035,axiom,
    ( ~ l0(X1)
    | ~ r0(X0)
    | m1(X0,X1,X0) ) ).

cnf(c0,plain,
    ~ m1(e,a,a),
    inference(clausification,[status(esa)],[prove_this]) ).

cnf(c6,plain,
    q0(b,b),
    inference(clausification,[status(esa)],[axiom_6]) ).

cnf(c12,plain,
    m0(a,X0,a),
    inference(clausification,[status(esa)],[axiom_12]) ).

cnf(c13,plain,
    r0(e),
    inference(clausification,[status(esa)],[axiom_13]) ).

cnf(c21,plain,
    q0(b,e),
    inference(clausification,[status(esa)],[axiom_21]) ).

cnf(c24,plain,
    l0(c),
    inference(clausification,[status(esa)],[axiom_24]) ).

cnf(c37,plain,
    n0(b,a),
    inference(clausification,[status(esa)],[axiom_37]) ).

cnf(c39,plain,
    ( ~ n0(X1,X0)
    | k1(X0) ),
    inference(clausification,[status(esa)],[rule_001]) ).

cnf(c54,plain,
    ( ~ m1(X2,X3,X1)
    | ~ m1(X2,X1,X0)
    | m1(X0,X1,X1) ),
    inference(clausification,[status(esa)],[rule_016]) ).

cnf(c62,plain,
    ( ~ m1(X1,c,X1)
    | ~ q0(X0,X1)
    | ~ m0(a,X2,a)
    | m1(X0,a,X1) ),
    inference(clausification,[status(esa)],[rule_024]) ).

cnf(c72,plain,
    ( ~ q0(X0,X0)
    | ~ k1(X1)
    | ~ k1(a)
    | m1(X0,X1,X1) ),
    inference(clausification,[status(esa)],[rule_034]) ).

cnf(c73,plain,
    ( ~ l0(X1)
    | ~ r0(X0)
    | m1(X0,X1,X0) ),
    inference(clausification,[status(esa)],[rule_035]) ).

cnf(d0,plain,
    ( ~ q0(X1,X0)
    | m1(X1,a,X0)
    | ~ m1(X0,c,X0) ),
    inference(resolution,[status(thm)],[c12,c62]) ).

cnf(d1,plain,
    ( ~ q0(X1,X0)
    | m1(X1,a,X0)
    | ~ l0(c)
    | ~ r0(X0) ),
    inference(resolution,[status(thm)],[c73,d0]) ).

cnf(d2,plain,
    ( ~ r0(X1)
    | ~ q0(X0,X1)
    | m1(X0,a,X1) ),
    inference(resolution,[status(thm)],[c24,d1]) ).

cnf(d3,plain,
    k1(a),
    inference(resolution,[status(thm)],[c39,c37]) ).

cnf(d4,plain,
    ( ~ k1(X1)
    | ~ q0(X0,X0)
    | m1(X0,X1,X1) ),
    inference(resolution,[status(thm)],[d3,c72]) ).

cnf(d5,plain,
    ( ~ k1(X0)
    | m1(b,X0,X0) ),
    inference(resolution,[status(thm)],[d4,c6]) ).

cnf(d6,plain,
    ( ~ m1(b,X0,X1)
    | m1(X1,X0,X0)
    | ~ k1(X0) ),
    inference(resolution,[status(thm)],[d5,c54]) ).

cnf(d7,plain,
    ( ~ r0(X0)
    | ~ q0(b,X0)
    | ~ k1(a)
    | m1(X0,a,a) ),
    inference(resolution,[status(thm)],[d6,d2]) ).

cnf(d8,plain,
    ( ~ r0(X0)
    | ~ q0(b,X0)
    | m1(X0,a,a) ),
    inference(resolution,[status(thm)],[d3,d7]) ).

cnf(d9,plain,
    ( ~ r0(e)
    | ~ q0(b,e) ),
    inference(resolution,[status(thm)],[d8,c0]) ).

cnf(d10,plain,
    ~ q0(b,e),
    inference(resolution,[status(thm)],[c13,d9]) ).

cnf(d11,plain,
    $false,
    inference(resolution,[status(thm)],[c21,d10]) ).

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