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

View Problem - Process Solution

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

% Computer : n022.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:50 EDT 2022

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

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

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

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

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

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

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

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

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

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

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

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

cnf(g11,plain,
    ( ~ sPE(op1(sK0,sK0),sK0)
    | sPE(sK0,op1(sK0,sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : ALG203+1 : TPTP v8.1.0. Released v2.7.0.
% 0.10/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n022.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 : Thu Jun  9 02:22:49 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 26.64/3.75  % symbols: 10
% 26.64/3.75  % clauses: 22
% 26.64/3.75  % start clauses: 6
% 26.64/3.75  % iterative deepening steps: 2654
% 26.64/3.75  % maximum path limit: 3
% 26.64/3.75  % literal attempts: 4437988
% 26.64/3.75  % depth failures: 3354039
% 26.64/3.75  % regularity failures: 72858
% 26.64/3.75  % tautology failures: 215510
% 26.64/3.75  % reductions: 379202
% 26.64/3.75  % extensions: 4053159
% 26.64/3.75  % SAT variables: 1224506
% 26.64/3.75  % SAT clauses: 1348889
% 26.64/3.75  % WalkSAT solutions: 1348870
% 26.64/3.75  % CDCL solutions: 18
% 26.64/3.75  % SZS status Theorem for theBenchmark
% 26.64/3.75  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------