↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n020.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 06:58:19 AM UTC 2026

% Result   : Unsatisfiable 9.74s 1.70s
% Output   : CNFRefutation 9.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   30 (  20 unt;   0 nHn;  30 RR)
%            Number of literals    :   44 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(direct_success,axiom,
    ( ~ follows(X0,X1)
    | succeeds(X0,X1) ) ).

cnf(transitivity_of_success,axiom,
    ( ~ succeeds(X2,X1)
    | ~ succeeds(X0,X2)
    | succeeds(X0,X1) ) ).

cnf(goto_success,axiom,
    ( ~ labels(X2,X0)
    | ~ has(X1,goto(X2))
    | succeeds(X0,X1) ) ).

cnf(label_state_3,hypothesis,
    labels(loop,p3) ).

cnf(transition_3_to_6,hypothesis,
    follows(p6,p3) ).

cnf(transition_6_to_7,hypothesis,
    follows(p7,p6) ).

cnf(transition_7_to_8,hypothesis,
    follows(p8,p7) ).

cnf(state_8,hypothesis,
    has(p8,goto(loop)) ).

cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
    ~ succeeds(p3,p3) ).

cnf(c0,plain,
    ( ~ follows(X0,X1)
    | succeeds(X0,X1) ),
    inference(clausification,[status(esa)],[direct_success]) ).

cnf(c1,plain,
    ( ~ succeeds(X2,X1)
    | ~ succeeds(X0,X2)
    | succeeds(X0,X1) ),
    inference(clausification,[status(esa)],[transitivity_of_success]) ).

cnf(c2,plain,
    ( ~ labels(X2,X0)
    | ~ has(X1,goto(X2))
    | succeeds(X0,X1) ),
    inference(clausification,[status(esa)],[goto_success]) ).

cnf(c7,plain,
    labels(loop,p3),
    inference(clausification,[status(esa)],[label_state_3]) ).

cnf(c12,plain,
    follows(p6,p3),
    inference(clausification,[status(esa)],[transition_3_to_6]) ).

cnf(c14,plain,
    follows(p7,p6),
    inference(clausification,[status(esa)],[transition_6_to_7]) ).

cnf(c16,plain,
    follows(p8,p7),
    inference(clausification,[status(esa)],[transition_7_to_8]) ).

cnf(c17,plain,
    has(p8,goto(loop)),
    inference(clausification,[status(esa)],[state_8]) ).

cnf(c18,plain,
    ~ succeeds(p3,p3),
    inference(clausification,[status(esa)],[prove_there_is_a_loop_through_p3]) ).

cnf(d0,plain,
    ( ~ labels(loop,X0)
    | succeeds(X0,p8) ),
    inference(resolution,[status(thm)],[c17,c2]) ).

cnf(d1,plain,
    succeeds(p3,p8),
    inference(resolution,[status(thm)],[d0,c7]) ).

cnf(d2,plain,
    ( succeeds(p3,X0)
    | ~ succeeds(p8,X0) ),
    inference(resolution,[status(thm)],[d1,c1]) ).

cnf(d3,plain,
    succeeds(p8,p7),
    inference(resolution,[status(thm)],[c16,c0]) ).

cnf(d4,plain,
    ( succeeds(p8,X0)
    | ~ succeeds(p7,X0) ),
    inference(resolution,[status(thm)],[d3,c1]) ).

cnf(d5,plain,
    succeeds(p6,p3),
    inference(resolution,[status(thm)],[c12,c0]) ).

cnf(d6,plain,
    succeeds(p7,p6),
    inference(resolution,[status(thm)],[c14,c0]) ).

cnf(d7,plain,
    ( succeeds(p7,X0)
    | ~ succeeds(p6,X0) ),
    inference(resolution,[status(thm)],[d6,c1]) ).

cnf(d8,plain,
    succeeds(p7,p3),
    inference(resolution,[status(thm)],[d7,d5]) ).

cnf(d9,plain,
    succeeds(p8,p3),
    inference(resolution,[status(thm)],[d8,d4]) ).

cnf(d10,plain,
    succeeds(p3,p3),
    inference(resolution,[status(thm)],[d9,d2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COM002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.05/0.34  % Computer : n020.cluster.edu
% 0.05/0.34  % Model    : x86_64 x86_64
% 0.05/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.34  % Memory   : 8046.5625MB
% 0.05/0.34  % OS       : Linux 6.8.0-71-generic
% 0.05/0.34  % CPULimit : 300
% 0.05/0.34  % WCLimit  : 300
% 0.05/0.34  % DateTime : Sat Sep 26 23:19:49 UTC 2026
% 0.05/0.34  % CPUTime  : 
% 0.05/0.34  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.74/1.70  % SZS status Unsatisfiable for theBenchmark.p
% 9.74/1.70  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------