TSTP Solution File: GEO467+1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GEO467+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sat Jul 16 06:12:00 EDT 2022

% Result   : Theorem 6.97s 1.66s
% Output   : Proof 6.97s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    p(s(bool,i(s(fun(fun(sK3978,bool),bool),finite),s(fun(sK3978,bool),sK3982)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSPANu_VSUM)]) ).

cnf(g1,plain,
    ~ p(s(bool,i(s(fun(fun(cart(real,sK3979),bool),bool),i(s(fun(cart(real,sK3979),fun(fun(cart(real,sK3979),bool),bool)),in),s(cart(real,sK3979),i(s(fun(fun(sK3978,cart(real,sK3979)),cart(real,sK3979)),i(s(fun(fun(sK3978,bool),fun(fun(sK3978,cart(real,sK3979)),cart(real,sK3979))),vsum),s(fun(sK3978,bool),sK3982))),s(fun(sK3978,cart(real,sK3979)),sK3981))))),s(fun(cart(real,sK3979),bool),i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSPANu_VSUM)]) ).

cnf(g2,plain,
    ( ~ p(s(bool,i(s(fun(fun(sK3978,bool),bool),finite),s(fun(sK3978,bool),sK3982))))
    | ~ p(s(bool,i(s(fun(fun(cart(real,sK3979),bool),bool),subspace),s(fun(cart(real,sK3979),bool),i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980))))))
    | p(s(bool,i(s(fun(fun(sK3978,bool),bool),i(s(fun(sK3978,fun(fun(sK3978,bool),bool)),in),s(sK3978,sK3965(sK3978,sK3979,i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)),sK3981,sK3982)))),s(fun(sK3978,bool),sK3982))))
    | p(s(bool,i(s(fun(fun(cart(real,sK3979),bool),bool),i(s(fun(cart(real,sK3979),fun(fun(cart(real,sK3979),bool),bool)),in),s(cart(real,sK3979),i(s(fun(fun(sK3978,cart(real,sK3979)),cart(real,sK3979)),i(s(fun(fun(sK3978,bool),fun(fun(sK3978,cart(real,sK3979)),cart(real,sK3979))),vsum),s(fun(sK3978,bool),sK3982))),s(fun(sK3978,cart(real,sK3979)),sK3981))))),s(fun(cart(real,sK3979),bool),i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSUBSPACEu_VSUM)]) ).

cnf(g3,plain,
    ( ~ p(s(bool,i(s(fun(fun(sK3978,bool),bool),finite),s(fun(sK3978,bool),sK3982))))
    | ~ p(s(bool,i(s(fun(fun(cart(real,sK3979),bool),bool),i(s(fun(cart(real,sK3979),fun(fun(cart(real,sK3979),bool),bool)),in),s(cart(real,sK3979),i(s(fun(sK3978,cart(real,sK3979)),sK3981),s(sK3978,sK3965(sK3978,sK3979,i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)),sK3981,sK3982)))))),s(fun(cart(real,sK3979),bool),i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980))))))
    | ~ p(s(bool,i(s(fun(fun(cart(real,sK3979),bool),bool),subspace),s(fun(cart(real,sK3979),bool),i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980))))))
    | p(s(bool,i(s(fun(fun(cart(real,sK3979),bool),bool),i(s(fun(cart(real,sK3979),fun(fun(cart(real,sK3979),bool),bool)),in),s(cart(real,sK3979),i(s(fun(fun(sK3978,cart(real,sK3979)),cart(real,sK3979)),i(s(fun(fun(sK3978,bool),fun(fun(sK3978,cart(real,sK3979)),cart(real,sK3979))),vsum),s(fun(sK3978,bool),sK3982))),s(fun(sK3978,cart(real,sK3979)),sK3981))))),s(fun(cart(real,sK3979),bool),i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSUBSPACEu_VSUM)]) ).

cnf(g4,plain,
    p(s(bool,i(s(fun(fun(cart(real,sK3979),bool),bool),subspace),s(fun(cart(real,sK3979),bool),i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSUBSPACEu_SPAN)]) ).

cnf(g5,plain,
    ( ~ p(s(bool,i(s(fun(fun(sK3978,bool),bool),i(s(fun(sK3978,fun(fun(sK3978,bool),bool)),in),s(sK3978,sK3965(sK3978,sK3979,i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)),sK3981,sK3982)))),s(fun(sK3978,bool),sK3982))))
    | p(s(bool,i(s(fun(fun(cart(real,sK3979),bool),bool),i(s(fun(cart(real,sK3979),fun(fun(cart(real,sK3979),bool),bool)),in),s(cart(real,sK3979),i(s(fun(sK3978,cart(real,sK3979)),sK3981),s(sK3978,sK3965(sK3978,sK3979,i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)),sK3981,sK3982)))))),s(fun(cart(real,sK3979),bool),i(s(fun(fun(cart(real,sK3979),bool),fun(cart(real,sK3979),bool)),span),s(fun(cart(real,sK3979),bool),sK3980)))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSPANu_VSUM)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO467+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Fri Jun 17 16:53:04 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 6.97/1.66  % symbols: 4826
% 6.97/1.66  % clauses: 11526
% 6.97/1.66  % start clauses: 3
% 6.97/1.66  % iterative deepening steps: 319
% 6.97/1.66  % maximum path limit: 2
% 6.97/1.66  % literal attempts: 399749
% 6.97/1.66  % depth failures: 309177
% 6.97/1.66  % regularity failures: 47
% 6.97/1.66  % tautology failures: 1576
% 6.97/1.66  % reductions: 88484
% 6.97/1.66  % extensions: 310734
% 6.97/1.66  % SAT variables: 134263
% 6.97/1.66  % SAT clauses: 109835
% 6.97/1.66  % WalkSAT solutions: 109830
% 6.97/1.66  % CDCL solutions: 0
% 6.97/1.66  % SZS status Theorem for theBenchmark
% 6.97/1.66  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------