↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWC051-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 : n010.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:13 PM UTC 2026

% Result   : Unsatisfiable 30.08s 4.29s
% Output   : Proof 30.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   42 (  22 unt;   0 def)
%            Number of atoms       :   71 (   6 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   66 (  37   ~;  29   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    8 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f58,axiom,
    ( rearsegP(U,U)
    | ~ ssList(U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause59) ).

fof(f58_nnf,plain,
    ! [U] :
      ( rearsegP(U,U)
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f58]) ).

fof(f58_sk,plain,
    ! [U] :
      ( rearsegP(U,U)
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f58_nnf]) ).

cnf(c58,plain,
    ( rearsegP(X0,X0)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f58_sk]) ).

cnf(f185,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).

fof(f185_nnf,plain,
    ssList(sk1),
    inference(nnf_transformation,[status(thm)],[f185]) ).

cnf(c185,plain,
    ssList(sk1),
    inference(cnf_transformation,[status(esa)],[f185_nnf]) ).

cnf(p363,plain,
    rearsegP(sk1,sk1),
    inference(resolution,[status(thm)],[c58,c185]) ).

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(f187,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).

fof(f187_nnf,plain,
    ssList(sk3),
    inference(nnf_transformation,[status(thm)],[f187]) ).

cnf(c187,plain,
    ssList(sk3),
    inference(cnf_transformation,[status(esa)],[f187_nnf]) ).

cnf(f192,negated_conjecture,
    ( ~ rearsegP(sk1,A)
    | ~ rearsegP(sk2,A)
    | ~ neq(A,nil)
    | ~ ssList(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f192_nnf,plain,
    ! [A] :
      ( ~ rearsegP(sk1,A)
      | ~ rearsegP(sk2,A)
      | ~ neq(A,nil)
      | ~ ssList(A) ),
    inference(nnf_transformation,[status(thm)],[f192]) ).

fof(f192_sk,plain,
    ! [A] :
      ( ~ rearsegP(sk1,A)
      | ~ rearsegP(sk2,A)
      | ~ neq(A,nil)
      | ~ ssList(A) ),
    inference(skolemisation,[status(esa)],[f192_nnf]) ).

cnf(c192,plain,
    ( ~ rearsegP(sk1,X0)
    | ~ rearsegP(sk2,X0)
    | ~ neq(X0,nil)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f192_sk]) ).

cnf(p201,plain,
    ( ~ rearsegP(sk1,sk3)
    | ~ rearsegP(sk2,sk3)
    | ~ neq(sk3,nil) ),
    inference(resolution,[status(thm)],[c187,c192]) ).

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(f194,negated_conjecture,
    ( neq(sk3,nil)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f194_nnf,plain,
    ( neq(sk3,nil)
    | ~ neq(sk4,nil) ),
    inference(nnf_transformation,[status(thm)],[f194]) ).

fof(f194_sk,plain,
    ( neq(sk3,nil)
    | ~ neq(sk4,nil) ),
    inference(skolemisation,[status(esa)],[f194_nnf]) ).

cnf(c194,plain,
    ( neq(sk3,nil)
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[status(esa)],[f194_sk]) ).

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

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

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

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

cnf(p202,plain,
    neq(sk3,nil),
    inference(resolution,[status(thm)],[p198,c191]) ).

cnf(p208,plain,
    ( ~ rearsegP(sk1,sk3)
    | ~ rearsegP(sk2,sk3) ),
    inference(resolution,[status(thm)],[p201,p202]) ).

cnf(f195,negated_conjecture,
    ( rearsegP(sk4,sk3)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

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

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

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

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

cnf(p209,plain,
    rearsegP(sk4,sk3),
    inference(resolution,[status(thm)],[p197,c191]) ).

cnf(p211,plain,
    rearsegP(sk2,sk3),
    inference(superposition,[status(thm)],[c189,p209]) ).

cnf(p214,plain,
    ~ rearsegP(sk1,sk3),
    inference(resolution,[status(thm)],[p208,p211]) ).

cnf(p215,plain,
    ~ rearsegP(sk1,sk1),
    inference(superposition,[status(thm)],[c190,p214]) ).

cnf(p428,plain,
    $false,
    inference(resolution,[status(thm)],[p363,p215]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC051-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.36  % Computer : n010.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Thu Sep 24 16:07:29 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 30.08/4.29  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.08/4.29  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------