↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n003.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:05:48 PM UTC 2026

% Result   : Unsatisfiable 30.71s 4.49s
% Output   : Proof 30.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (  12 unt;   0 def)
%            Number of atoms       :   38 (   6 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   28 (  15   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 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(f189,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/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(f190,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/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(f195,negated_conjecture,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f195_nnf,plain,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    inference(nnf_transformation,[status(thm)],[f195]) ).

fof(f195_sk,plain,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    inference(skolemisation,[status(esa)],[f195_nnf]) ).

cnf(c195,plain,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    inference(cnf_transformation,[status(esa)],[f195_sk]) ).

cnf(p198,plain,
    ( ~ neq(sk2,nil)
    | singletonP(sk3) ),
    inference(superposition,[status(thm)],[c189,c195]) ).

cnf(f191,negated_conjecture,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f191_nnf,plain,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    inference(nnf_transformation,[status(thm)],[f191]) ).

fof(f191_sk,plain,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    inference(skolemisation,[status(esa)],[f191_nnf]) ).

cnf(c191,plain,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    inference(cnf_transformation,[status(esa)],[f191_sk]) ).

cnf(p197,plain,
    neq(sk2,nil),
    inference(factoring,[status(thm)],[c191]) ).

cnf(p199,plain,
    singletonP(sk3),
    inference(resolution,[status(thm)],[p198,p197]) ).

cnf(p200,plain,
    singletonP(sk1),
    inference(superposition,[status(thm)],[c190,p199]) ).

cnf(f196,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ~ singletonP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f196_nnf,plain,
    ( ~ neq(sk4,nil)
    | ~ singletonP(sk1) ),
    inference(nnf_transformation,[status(thm)],[f196]) ).

fof(f196_sk,plain,
    ( ~ neq(sk4,nil)
    | ~ singletonP(sk1) ),
    inference(skolemisation,[status(esa)],[f196_nnf]) ).

cnf(c196,plain,
    ( ~ neq(sk4,nil)
    | ~ singletonP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f196_sk]) ).

cnf(p201,plain,
    ~ neq(sk4,nil),
    inference(resolution,[status(thm)],[p200,c196]) ).

cnf(p202,plain,
    ~ neq(sk2,nil),
    inference(superposition,[status(thm)],[c189,p201]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC255-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.35  % Computer : n003.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Thu Sep 24 17:16:21 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 30.71/4.49  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.71/4.49  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------