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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n032.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:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    sorti2(sK1),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4)]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09  % Problem  : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% 0.09/0.09  % Command  : satcop --statistics %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Wed Jun  8 16:47:06 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 59.00/7.68  % symbols: 10
% 59.00/7.68  % clauses: 22
% 59.00/7.68  % start clauses: 6
% 59.00/7.68  % iterative deepening steps: 4117
% 59.00/7.68  % maximum path limit: 4
% 59.00/7.68  % literal attempts: 11215023
% 59.00/7.68  % depth failures: 8976328
% 59.00/7.68  % regularity failures: 157760
% 59.00/7.68  % tautology failures: 398976
% 59.00/7.68  % reductions: 689125
% 59.00/7.68  % extensions: 10516918
% 59.00/7.68  % SAT variables: 1822051
% 59.00/7.68  % SAT clauses: 1964630
% 59.00/7.68  % WalkSAT solutions: 1964592
% 59.00/7.68  % CDCL solutions: 33
% 59.00/7.68  % SZS status Theorem for theBenchmark
% 59.00/7.68  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------