↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n021.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:46 EDT 2022

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

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

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

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

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

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

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

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

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

cnf(g8,plain,
    sPE(j(sK1),j(sK1)),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ALG179+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n021.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun  7 23:34:06 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 88.46/11.57  % symbols: 10
% 88.46/11.57  % clauses: 21
% 88.46/11.57  % start clauses: 6
% 88.46/11.57  % iterative deepening steps: 6268
% 88.46/11.57  % maximum path limit: 4
% 88.46/11.57  % literal attempts: 12052391
% 88.46/11.57  % depth failures: 9174814
% 88.46/11.57  % regularity failures: 213832
% 88.46/11.57  % tautology failures: 533099
% 88.46/11.57  % reductions: 954834
% 88.46/11.57  % extensions: 11087332
% 88.46/11.57  % SAT variables: 3039365
% 88.46/11.57  % SAT clauses: 3354353
% 88.46/11.57  % WalkSAT solutions: 3354295
% 88.46/11.57  % CDCL solutions: 56
% 88.46/11.57  % SZS status Theorem for theBenchmark
% 88.46/11.57  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------