↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : ALG018+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n028.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 : Thu Jul 14 17:58:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( ~ sorti1(sK0)
    | sorti2(h(sK0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).

cnf(g1,plain,
    sorti1(sK0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3)]) ).

cnf(g2,plain,
    ( ~ sorti2(h(sK0))
    | sorti2(sK1(h(sK0))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4)]) ).

cnf(g3,plain,
    ( ~ sPE(op2(sK1(h(sK0)),sK1(h(sK0))),h(sK0))
    | ~ sorti2(h(sK0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4)]) ).

cnf(g4,plain,
    ( ~ sorti1(sK0)
    | sPE(j(h(sK0)),sK0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).

cnf(g5,plain,
    ( ~ sPE(j(h(sK0)),sK0)
    | sPE(h(j(h(sK0))),h(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ sorti2(sK1(h(sK0)))
    | sorti1(j(sK1(h(sK0)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).

cnf(g7,plain,
    ( ~ sorti2(sK1(h(sK0)))
    | ~ sorti2(sK1(h(sK0)))
    | sPE(j(op2(sK1(h(sK0)),sK1(h(sK0)))),op1(j(sK1(h(sK0))),j(sK1(h(sK0))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).

cnf(g8,plain,
    ( ~ sorti1(j(sK1(h(sK0))))
    | sPE(op1(j(sK1(h(sK0))),j(sK1(h(sK0)))),sK0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3)]) ).

cnf(g9,plain,
    ( ~ sPE(j(op2(sK1(h(sK0)),sK1(h(sK0)))),op1(j(sK1(h(sK0))),j(sK1(h(sK0)))))
    | ~ sPE(op1(j(sK1(h(sK0))),j(sK1(h(sK0)))),sK0)
    | sPE(j(op2(sK1(h(sK0)),sK1(h(sK0)))),sK0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(j(op2(sK1(h(sK0)),sK1(h(sK0)))),sK0)
    | sPE(h(j(op2(sK1(h(sK0)),sK1(h(sK0))))),h(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sorti2(sK1(h(sK0)))
    | ~ sorti2(sK1(h(sK0)))
    | sorti2(op2(sK1(h(sK0)),sK1(h(sK0)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2)]) ).

cnf(g12,plain,
    ( ~ sorti2(op2(sK1(h(sK0)),sK1(h(sK0))))
    | sPE(h(j(op2(sK1(h(sK0)),sK1(h(sK0))))),op2(sK1(h(sK0)),sK1(h(sK0)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).

cnf(g13,plain,
    ( ~ sPE(op2(sK1(h(sK0)),sK1(h(sK0))),h(j(h(sK0))))
    | ~ sPE(h(j(h(sK0))),h(sK0))
    | sPE(op2(sK1(h(sK0)),sK1(h(sK0))),h(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(h(j(h(sK0))),op2(sK1(h(sK0)),sK1(h(sK0))))
    | sPE(op2(sK1(h(sK0)),sK1(h(sK0))),h(j(h(sK0)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(h(j(op2(sK1(h(sK0)),sK1(h(sK0))))),h(sK0))
    | sPE(h(sK0),h(j(op2(sK1(h(sK0)),sK1(h(sK0)))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ sPE(h(j(h(sK0))),h(j(op2(sK1(h(sK0)),sK1(h(sK0))))))
    | ~ sPE(h(j(op2(sK1(h(sK0)),sK1(h(sK0))))),op2(sK1(h(sK0)),sK1(h(sK0))))
    | sPE(h(j(h(sK0))),op2(sK1(h(sK0)),sK1(h(sK0)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(h(j(h(sK0))),h(sK0))
    | ~ sPE(h(sK0),h(j(op2(sK1(h(sK0)),sK1(h(sK0))))))
    | sPE(h(j(h(sK0))),h(j(op2(sK1(h(sK0)),sK1(h(sK0)))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ALG018+1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  9 02:11:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 31.24/4.37  % symbols: 10
% 31.24/4.37  % clauses: 22
% 31.24/4.37  % start clauses: 6
% 31.24/4.37  % iterative deepening steps: 3242
% 31.24/4.37  % maximum path limit: 4
% 31.24/4.37  % literal attempts: 7045000
% 31.24/4.37  % depth failures: 5551687
% 31.24/4.37  % regularity failures: 93574
% 31.24/4.37  % tautology failures: 240347
% 31.24/4.37  % reductions: 506982
% 31.24/4.37  % extensions: 6531640
% 31.24/4.37  % SAT variables: 972702
% 31.24/4.37  % SAT clauses: 1047889
% 31.24/4.37  % WalkSAT solutions: 1047875
% 31.24/4.37  % CDCL solutions: 12
% 31.24/4.37  % SZS status Theorem for theBenchmark
% 31.24/4.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------