↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : COM002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n012.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 : Fri Sep 25 01:03:16 PM UTC 2026

% Result   : Unsatisfiable 2.67s 0.77s
% Output   : Proof 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   42 (  23 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   58 (  30   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 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   :   39 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f2,axiom,
    ( ~ labels(Label,Goal_state)
    | ~ has(Start_state,goto(Label))
    | ~ fails(Goal_state,Start_state) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).

fof(f2_nnf,plain,
    ! [Goal_state,Start_state,Label] :
      ( ~ labels(Label,Goal_state)
      | ~ has(Start_state,goto(Label))
      | ~ fails(Goal_state,Start_state) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [Goal_state,Start_state,Label] :
      ( ~ labels(Label,Goal_state)
      | ~ has(Start_state,goto(Label))
      | ~ fails(Goal_state,Start_state) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( ~ labels(X2,X0)
    | ~ has(X1,goto(X2))
    | ~ fails(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(f1,axiom,
    ( fails(Intermediate_state,Start_state)
    | fails(Goal_state,Intermediate_state)
    | ~ fails(Goal_state,Start_state) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).

fof(f1_nnf,plain,
    ! [Goal_state,Start_state,Intermediate_state] :
      ( fails(Intermediate_state,Start_state)
      | fails(Goal_state,Intermediate_state)
      | ~ fails(Goal_state,Start_state) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [Goal_state,Start_state,Intermediate_state] :
      ( fails(Intermediate_state,Start_state)
      | fails(Goal_state,Intermediate_state)
      | ~ fails(Goal_state,Start_state) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( fails(X2,X1)
    | fails(X0,X2)
    | ~ fails(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(f18,negated_conjecture,
    fails(p3,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).

fof(f18_nnf,plain,
    fails(p3,p3),
    inference(nnf_transformation,[status(thm)],[f18]) ).

cnf(c18,plain,
    fails(p3,p3),
    inference(cnf_transformation,[status(esa)],[f18_nnf]) ).

cnf(p20,plain,
    ( fails(X0,p3)
    | fails(p3,X0) ),
    inference(resolution,[status(thm)],[c1,c18]) ).

cnf(p28,plain,
    ( fails(X0,p3)
    | ~ labels(X1,p3)
    | ~ has(X0,goto(X1)) ),
    inference(resolution,[status(thm)],[c2,p20]) ).

cnf(f17,hypothesis,
    has(p8,goto(loop)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).

fof(f17_nnf,plain,
    has(p8,goto(loop)),
    inference(nnf_transformation,[status(thm)],[f17]) ).

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

cnf(p142,plain,
    ( fails(p8,p3)
    | ~ labels(loop,p3) ),
    inference(resolution,[status(thm)],[p28,c17]) ).

cnf(f7,hypothesis,
    labels(loop,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).

fof(f7_nnf,plain,
    labels(loop,p3),
    inference(nnf_transformation,[status(thm)],[f7]) ).

cnf(c7,plain,
    labels(loop,p3),
    inference(cnf_transformation,[status(esa)],[f7_nnf]) ).

cnf(p155,plain,
    fails(p8,p3),
    inference(resolution,[status(thm)],[p142,c7]) ).

cnf(p157,plain,
    ( fails(X0,p3)
    | fails(p8,X0) ),
    inference(resolution,[status(thm)],[p155,c1]) ).

cnf(f0,axiom,
    ( ~ follows(Goal_state,Start_state)
    | ~ fails(Goal_state,Start_state) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).

fof(f0_nnf,plain,
    ! [Goal_state,Start_state] :
      ( ~ follows(Goal_state,Start_state)
      | ~ fails(Goal_state,Start_state) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [Goal_state,Start_state] :
      ( ~ follows(Goal_state,Start_state)
      | ~ fails(Goal_state,Start_state) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( ~ follows(X0,X1)
    | ~ fails(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p182,plain,
    ( ~ follows(p8,X0)
    | fails(X0,p3) ),
    inference(resolution,[status(thm)],[p157,c0]) ).

cnf(f16,hypothesis,
    follows(p8,p7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).

fof(f16_nnf,plain,
    follows(p8,p7),
    inference(nnf_transformation,[status(thm)],[f16]) ).

cnf(c16,plain,
    follows(p8,p7),
    inference(cnf_transformation,[status(esa)],[f16_nnf]) ).

cnf(p197,plain,
    fails(p7,p3),
    inference(resolution,[status(thm)],[p182,c16]) ).

cnf(p199,plain,
    ( fails(X0,p3)
    | fails(p7,X0) ),
    inference(resolution,[status(thm)],[p197,c1]) ).

cnf(p212,plain,
    ( ~ follows(p7,X0)
    | fails(X0,p3) ),
    inference(resolution,[status(thm)],[p199,c0]) ).

cnf(f14,hypothesis,
    follows(p7,p6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).

fof(f14_nnf,plain,
    follows(p7,p6),
    inference(nnf_transformation,[status(thm)],[f14]) ).

cnf(c14,plain,
    follows(p7,p6),
    inference(cnf_transformation,[status(esa)],[f14_nnf]) ).

cnf(p233,plain,
    fails(p6,p3),
    inference(resolution,[status(thm)],[p212,c14]) ).

cnf(p235,plain,
    ~ follows(p6,p3),
    inference(resolution,[status(thm)],[p233,c0]) ).

cnf(f12,hypothesis,
    follows(p6,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).

fof(f12_nnf,plain,
    follows(p6,p3),
    inference(nnf_transformation,[status(thm)],[f12]) ).

cnf(c12,plain,
    follows(p6,p3),
    inference(cnf_transformation,[status(esa)],[f12_nnf]) ).

cnf(p243,plain,
    $false,
    inference(resolution,[status(thm)],[p235,c12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : COM002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.03/0.29  % Computer : n012.cluster.edu
% 0.03/0.29  % Model    : x86_64 x86_64
% 0.03/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29  % Memory   : 8046.5625MB
% 0.03/0.29  % OS       : Linux 6.8.0-71-generic
% 0.03/0.29  % CPULimit : 300
% 0.03/0.29  % WCLimit  : 300
% 0.03/0.29  % DateTime : Fri Sep 25 07:42:50 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 0.03/0.30  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.67/0.77  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.67/0.77  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------