↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n001.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 02:00:39 PM UTC 2026

% Result   : Unsatisfiable 11.92s 2.17s
% Output   : Proof 11.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   53
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   78 (  74 unt;   0 def)
%            Number of atoms       :   86 (  65 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-4 aty)
%            Number of variables   :  241 ( 109 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    ( is_a_theorem(Y)
    | ~ is_a_theorem(X)
    | ~ is_a_theorem(or(not(X),Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f0_nnf,plain,
    ! [X,Y] :
      ( is_a_theorem(Y)
      | ~ is_a_theorem(X)
      | ~ is_a_theorem(or(not(X),Y)) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y] :
      ( is_a_theorem(Y)
      | ~ is_a_theorem(X)
      | ~ is_a_theorem(or(not(X),Y)) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(X0)
    | ~ is_a_theorem(or(not(X0),X1)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    ifeq(is_a_theorem(or(not(X0),X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(f1,axiom,
    is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(not(or(not(U),X)),or(Z,or(V,X))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_CAMeredith) ).

fof(f1_nnf,plain,
    ! [X,Y,Z,U,V] : is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(not(or(not(U),X)),or(Z,or(V,X))))),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y,Z,U,V] : is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(not(or(not(U),X)),or(Z,or(V,X))))),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))),or(not(or(not(X3),X0)),or(X2,or(X4,X0))))),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))),or(not(or(not(X3),X0)),or(X2,or(X4,X0))))) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(h0,plain,
    is_a_theorem(or(not(or(not(V0),or(not(V1),V2))),or(not(or(not(V3),V1)),or(or(V4,V1),or(not(V1),V2))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,hi1]) ).

cnf(h1,plain,
    is_a_theorem(or(not(or(not(or(V0,V1)),V2)),or(not(or(not(V3),V1)),or(or(not(V1),V4),V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h0]) ).

cnf(h2,plain,
    is_a_theorem(or(not(or(not(or(not(V0),V1)),or(V2,V0))),or(not(or(not(V3),V0)),or(V4,or(V2,V0))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h1]) ).

cnf(h3,plain,
    is_a_theorem(or(not(or(not(V0),or(not(V1),or(V2,V1)))),or(V3,or(not(or(not(V4),V1)),or(not(V1),or(V2,V1)))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h2,h2]) ).

cnf(h5,plain,
    is_a_theorem(or(not(or(not(not(or(not(V0),V1))),V2)),or(V3,or(or(not(V1),or(V4,V1)),V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h3]) ).

cnf(h7,plain,
    is_a_theorem(or(V0,or(not(or(not(V1),V2)),or(not(V2),or(or(not(V3),or(V4,V3)),V2))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h3,h5]) ).

cnf(h9,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(not(V1),or(or(not(V2),or(V3,V2)),V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h7,h7]) ).

cnf(h17,plain,
    is_a_theorem(or(not(or(not(or(not(V0),or(V1,V0))),V2)),or(not(V3),or(V3,V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h9]) ).

cnf(h20,plain,
    is_a_theorem(or(V0,or(not(or(not(V1),V2)),or(not(V2),or(V2,V2))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h3,h17]) ).

cnf(h30,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(not(V1),or(V1,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h20,h20]) ).

cnf(h41,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(not(V0),or(V0,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h30]) ).

cnf(h45,plain,
    is_a_theorem(or(not(or(not(V0),V0)),or(not(V0),or(V1,V0)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h41]) ).

cnf(h50,plain,
    is_a_theorem(or(V0,or(not(or(not(V1),V2)),or(not(V2),or(V3,V2))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h3,h45]) ).

cnf(h64,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(not(V1),or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h50,h50]) ).

cnf(h76,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(not(V2),or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h64]) ).

cnf(h86,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(not(V0),or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h76]) ).

cnf(h129,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(V2,or(not(V1),or(V3,V1))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h86,h64]) ).

cnf(h159,plain,
    is_a_theorem(or(not(or(not(not(V0)),V1)),or(V2,or(or(V3,V0),V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h129]) ).

cnf(h173,plain,
    is_a_theorem(or(not(or(not(or(V0,V1)),not(V1))),or(V2,or(V3,not(V1))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h159]) ).

cnf(h75,plain,
    is_a_theorem(or(not(or(not(V0),or(V1,V2))),or(V3,or(not(V2),or(V1,V2))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h2,h64]) ).

cnf(h258,plain,
    is_a_theorem(or(V0,or(not(or(V1,not(V2))),or(V3,or(V1,not(V2)))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h75,h173]) ).

cnf(h299,plain,
    is_a_theorem(or(not(or(V0,not(V1))),or(V2,or(V0,not(V1))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h258,h258]) ).

cnf(h306,plain,
    is_a_theorem(or(not(or(not(not(V0)),V0)),or(V1,or(not(V2),V0)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h299]) ).

cnf(h317,plain,
    is_a_theorem(or(V0,or(not(or(not(V1),V2)),or(V3,or(not(V1),V2))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h75,h306]) ).

cnf(h339,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(V2,or(not(V0),V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h317,h317]) ).

cnf(h347,plain,
    is_a_theorem(or(not(or(not(not(V0)),V0)),or(V1,or(V2,V0)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h339]) ).

cnf(h373,plain,
    is_a_theorem(or(not(or(not(V0),not(V1))),or(V2,or(V1,not(V1))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h347]) ).

cnf(h370,plain,
    is_a_theorem(or(V0,or(not(or(V1,V2)),or(V3,or(V1,V2))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h75,h347]) ).

cnf(h384,plain,
    is_a_theorem(or(not(or(V0,V1)),or(V2,or(V0,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h370,h370]) ).

cnf(h389,plain,
    is_a_theorem(or(not(or(V0,V1)),or(V2,or(V3,or(V0,V1))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h86,h384]) ).

cnf(h392,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(V2,or(or(not(V1),V3),V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h389]) ).

cnf(h450,plain,
    is_a_theorem(or(not(or(not(or(not(V0),V1)),V2)),or(V3,or(V0,V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h392]) ).

cnf(h465,plain,
    is_a_theorem(or(V0,or(V1,or(V2,or(V3,not(V3)))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h450,h373]) ).

cnf(h504,plain,
    is_a_theorem(or(V0,or(V1,or(V2,not(V2))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h465,h465]) ).

cnf(h507,plain,
    is_a_theorem(or(V0,or(V1,not(V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h504,h504]) ).

cnf(h511,plain,
    is_a_theorem(or(V0,not(V0))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h507,h507]) ).

cnf(h516,plain,
    is_a_theorem(or(V0,or(V1,not(not(or(not(V1),V2)))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h450,h511]) ).

cnf(h1037,plain,
    is_a_theorem(or(V0,not(not(or(not(V0),V1))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h516,h516]) ).

cnf(h476,plain,
    is_a_theorem(or(V0,or(V1,or(not(V2),or(V2,V3))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h450,h76]) ).

cnf(h803,plain,
    is_a_theorem(or(V0,or(not(V1),or(V1,V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h476,h476]) ).

cnf(h804,plain,
    is_a_theorem(or(not(V0),or(V0,V1))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h803,h803]) ).

cnf(h827,plain,
    is_a_theorem(or(V0,or(not(V1),or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h75,h804]) ).

cnf(h927,plain,
    is_a_theorem(or(not(V0),or(V1,V0))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h827,h827]) ).

cnf(h117,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(V2,or(not(V0),or(V3,V1))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h86,h86]) ).

cnf(h387,plain,
    is_a_theorem(or(V0,or(not(or(V1,V2)),or(V3,or(V4,or(V1,V2)))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h117,h384]) ).

cnf(h435,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(not(or(V2,V3)),or(or(V4,or(V2,V3)),V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h387]) ).

cnf(h436,plain,
    is_a_theorem(or(not(or(not(or(V0,or(V1,V2))),V3)),or(not(or(V1,V2)),or(V4,V3)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h435]) ).

cnf(h826,plain,
    is_a_theorem(or(not(V0),or(V1,or(V0,V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h86,h804]) ).

cnf(h909,plain,
    is_a_theorem(or(not(or(not(or(not(V0),V1)),V0)),or(V2,or(V3,V0)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h826]) ).

cnf(h4860,plain,
    is_a_theorem(or(V0,or(V1,or(not(or(V2,V3)),or(V2,V3))))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h909,h436]) ).

cnf(h5017,plain,
    is_a_theorem(or(V0,or(not(or(V1,V2)),or(V1,V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h4860,h4860]) ).

cnf(h5035,plain,
    is_a_theorem(or(not(or(not(V0),V1)),or(not(or(V0,V2)),or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h5017]) ).

cnf(h5114,plain,
    is_a_theorem(or(not(or(V0,V1)),or(V1,or(V2,V0)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h5035,h927]) ).

cnf(h5740,plain,
    is_a_theorem(or(not(not(or(not(V0),V1))),or(V2,V0))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h5114,h1037]) ).

cnf(h6327,plain,
    is_a_theorem(or(V0,or(V1,or(not(V2),V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h347,h5740]) ).

cnf(h6345,plain,
    is_a_theorem(or(V0,or(not(V1),V1))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h6327,h6327]) ).

cnf(h6361,plain,
    is_a_theorem(or(not(V0),V0)) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h6345,h6345]) ).

cnf(h6383,plain,
    is_a_theorem(or(not(or(V0,V1)),or(V1,V0))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h5035,h6361]) ).

cnf(h7093,plain,
    is_a_theorem(or(V0,or(not(or(V1,V2)),or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h927,h6383]) ).

cnf(t105,plain,
    is_a_theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h7093]) ).

cnf(t448,plain,
    is_a_theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
    inference(orient,[status(thm)],[t105]) ).

cnf(f2,negated_conjecture,
    ~ is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_1) ).

fof(f2_nnf,plain,
    ~ is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ~ is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ~ is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(goal_0,negated_conjecture,
    is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))) != true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t448]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n001.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 21:40:21 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 11.92/2.17  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.92/2.17  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------