↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWC375-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n015.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 03:06:11 PM UTC 2026

% Result   : Unsatisfiable 26.36s 4.30s
% Output   : Proof 26.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (  15 unt;   0 def)
%            Number of atoms       :   35 (  12 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   21 (  11   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f190,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f190_nnf,plain,
    sk1 = sk3,
    inference(nnf_transformation,[status(thm)],[f190]) ).

cnf(c190,plain,
    sk1 = sk3,
    inference(cnf_transformation,[status(esa)],[f190_nnf]) ).

cnf(f191,negated_conjecture,
    sk4 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f191_nnf,plain,
    sk4 = sk3,
    inference(nnf_transformation,[status(thm)],[f191]) ).

cnf(c191,plain,
    sk4 = sk3,
    inference(cnf_transformation,[status(esa)],[f191_nnf]) ).

cnf(p196,plain,
    sk3 = sk1,
    inference(superposition,[status(thm)],[c190,c191]) ).

cnf(f189,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

fof(f189_nnf,plain,
    sk2 = sk4,
    inference(nnf_transformation,[status(thm)],[f189]) ).

cnf(c189,plain,
    sk2 = sk4,
    inference(cnf_transformation,[status(esa)],[f189_nnf]) ).

cnf(p195,plain,
    sk2 = sk3,
    inference(superposition,[status(thm)],[c189,c191]) ).

cnf(p198,plain,
    sk2 = sk1,
    inference(demodulation,[status(thm)],[p196,p195]) ).

cnf(f193,negated_conjecture,
    ( memberP(sk1,sk5)
    | memberP(sk2,sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f193_nnf,plain,
    ( memberP(sk1,sk5)
    | memberP(sk2,sk5) ),
    inference(nnf_transformation,[status(thm)],[f193]) ).

fof(f193_sk,plain,
    ( memberP(sk1,sk5)
    | memberP(sk2,sk5) ),
    inference(skolemisation,[status(esa)],[f193_nnf]) ).

cnf(c193,plain,
    ( memberP(sk1,sk5)
    | memberP(sk2,sk5) ),
    inference(cnf_transformation,[status(esa)],[f193_sk]) ).

cnf(p200,plain,
    ( memberP(sk1,sk5)
    | memberP(sk1,sk5) ),
    inference(superposition,[status(thm)],[p198,c193]) ).

cnf(p202,plain,
    memberP(sk1,sk5),
    inference(factoring,[status(thm)],[p200]) ).

cnf(f194,negated_conjecture,
    ( ~ memberP(sk1,sk5)
    | ~ memberP(sk2,sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f194_nnf,plain,
    ( ~ memberP(sk1,sk5)
    | ~ memberP(sk2,sk5) ),
    inference(nnf_transformation,[status(thm)],[f194]) ).

fof(f194_sk,plain,
    ( ~ memberP(sk1,sk5)
    | ~ memberP(sk2,sk5) ),
    inference(skolemisation,[status(esa)],[f194_nnf]) ).

cnf(c194,plain,
    ( ~ memberP(sk1,sk5)
    | ~ memberP(sk2,sk5) ),
    inference(cnf_transformation,[status(esa)],[f194_sk]) ).

cnf(p199,plain,
    ( ~ memberP(sk1,sk5)
    | ~ memberP(sk1,sk5) ),
    inference(superposition,[status(thm)],[p198,c194]) ).

cnf(p201,plain,
    ~ memberP(sk1,sk5),
    inference(factoring,[status(thm)],[p199]) ).

cnf(p203,plain,
    $false,
    inference(resolution,[status(thm)],[p202,p201]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC375-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n015.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Thu Sep 24 17:58:26 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 26.36/4.30  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.36/4.30  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------