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

View Problem - Process Solution

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

% Computer : n023.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 : Mon Jul 18 17:53:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    occurrence_of(sK18,tptp0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).

cnf(g1,plain,
    ( ~ occurrence_of(sK18,tptp0)
    | leaf_occ(sK17(sK18),sK18) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35)]) ).

cnf(g2,plain,
    ( min_precedes(sK18,sK20(sK18,sK17(sK18)),tptp0)
    | ~ sP0(sK18,sK17(sK18)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).

cnf(g3,plain,
    ( ~ leaf_occ(sK17(sK18),sK18)
    | min_precedes(sK18,sK19(sK18,sK17(sK18)),tptp0)
    | sP0(sK18,sK17(sK18)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).

cnf(g4,plain,
    ~ atomic(tptp0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_37)]) ).

cnf(g5,plain,
    ( ~ legal(sK18)
    | arboreal(sK18) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08)]) ).

cnf(g6,plain,
    ( ~ leaf_occ(sK17(sK18),sK18)
    | occurrence_of(sK18,sK14(sK17(sK18),sK18)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34)]) ).

cnf(g7,plain,
    ( ~ min_precedes(sK18,sK20(sK18,sK17(sK18)),tptp0)
    | atocc(sK18,sK1(tptp0,sK18,sK20(sK18,sK17(sK18)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_11)]) ).

cnf(g8,plain,
    ( ~ min_precedes(sK18,sK19(sK18,sK17(sK18)),tptp0)
    | precedes(sK18,sK19(sK18,sK17(sK18))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15)]) ).

cnf(g9,plain,
    ( ~ occurrence_of(sK18,tptp0)
    | ~ occurrence_of(sK18,sK14(sK17(sK18),sK18))
    | sPE(tptp0,sK14(sK17(sK18),sK18)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02)]) ).

cnf(g10,plain,
    ( ~ sPE(tptp0,sK14(sK17(sK18),sK18))
    | sPE(sK14(sK17(sK18),sK18),tptp0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(sK14(sK17(sK18),sK18),tptp0)
    | ~ atomic(sK14(sK17(sK18),sK18))
    | atomic(tptp0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ occurrence_of(sK18,sK14(sK17(sK18),sK18))
    | ~ arboreal(sK18)
    | atomic(sK14(sK17(sK18),sK18)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07)]) ).

cnf(g13,plain,
    ( ~ precedes(sK18,sK19(sK18,sK17(sK18)))
    | earlier(sK18,sK19(sK18,sK17(sK18))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10)]) ).

cnf(g14,plain,
    ( ~ precedes(sK18,sK19(sK18,sK17(sK18)))
    | legal(sK19(sK18,sK17(sK18))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10)]) ).

cnf(g15,plain,
    ( ~ atocc(sK18,sK1(tptp0,sK18,sK20(sK18,sK17(sK18))))
    | atomic(sK8(sK18,sK1(tptp0,sK18,sK20(sK18,sK17(sK18))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_23)]) ).

cnf(g16,plain,
    ( ~ atocc(sK18,sK1(tptp0,sK18,sK20(sK18,sK17(sK18))))
    | occurrence_of(sK18,sK8(sK18,sK1(tptp0,sK18,sK20(sK18,sK17(sK18))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_23)]) ).

cnf(g17,plain,
    ( ~ earlier(sK18,sK19(sK18,sK17(sK18)))
    | ~ legal(sK19(sK18,sK17(sK18)))
    | legal(sK18) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09)]) ).

cnf(g18,plain,
    ( ~ occurrence_of(sK18,sK8(sK18,sK1(tptp0,sK18,sK20(sK18,sK17(sK18)))))
    | ~ atomic(sK8(sK18,sK1(tptp0,sK18,sK20(sK18,sK17(sK18)))))
    | arboreal(sK18) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : PRO011+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n023.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % 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 : Mon Jun 13 01:23:21 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 16.63/2.64  % symbols: 46
% 16.63/2.64  % clauses: 135
% 16.63/2.64  % start clauses: 5
% 16.63/2.64  % iterative deepening steps: 966
% 16.63/2.64  % maximum path limit: 3
% 16.63/2.64  % literal attempts: 7386257
% 16.63/2.64  % depth failures: 6642606
% 16.63/2.64  % regularity failures: 23683
% 16.63/2.64  % tautology failures: 134335
% 16.63/2.64  % reductions: 280729
% 16.63/2.64  % extensions: 7102902
% 16.63/2.64  % SAT variables: 302398
% 16.63/2.64  % SAT clauses: 352547
% 16.63/2.64  % WalkSAT solutions: 352544
% 16.63/2.64  % CDCL solutions: 2
% 16.63/2.64  % SZS status Theorem for theBenchmark
% 16.63/2.64  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------