TSTP Solution File: PRO018+4 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : PRO018+4 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 17:53:08 EDT 2022

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

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

cnf(g1,plain,
    subactivity_occurrence(sK15,sK16),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).

cnf(g2,plain,
    arboreal(sK15),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).

cnf(g3,plain,
    ~ leaf_occ(sK15,sK16),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).

cnf(g4,plain,
    ( ~ occurrence_of(sK16,tptp0)
    | ~ subactivity_occurrence(sK15,sK16)
    | ~ arboreal(sK15)
    | leaf_occ(sK15,sK16)
    | min_precedes(sK12(sK15,sK16),sK13(sK15,sK16),tptp0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).

cnf(g5,plain,
    ( ~ occurrence_of(sK16,tptp0)
    | ~ subactivity_occurrence(sK15,sK16)
    | ~ arboreal(sK15)
    | leaf_occ(sK15,sK16)
    | min_precedes(sK13(sK15,sK16),sK14(sK15,sK16),tptp0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).

cnf(g6,plain,
    ( ~ occurrence_of(sK16,tptp0)
    | ~ subactivity_occurrence(sK15,sK16)
    | ~ arboreal(sK15)
    | occurrence_of(sK13(sK15,sK16),tptp4)
    | leaf_occ(sK15,sK16) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).

cnf(g7,plain,
    ( ~ occurrence_of(sK16,tptp0)
    | ~ subactivity_occurrence(sK15,sK16)
    | ~ arboreal(sK15)
    | leaf_occ(sK15,sK16)
    | next_subocc(sK15,sK12(sK15,sK16),tptp0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).

cnf(g8,plain,
    ( ~ next_subocc(sK15,sK12(sK15,sK16),tptp0)
    | arboreal(sK12(sK15,sK16)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_25)]) ).

cnf(g9,plain,
    ( ~ min_precedes(sK12(sK15,sK16),sK13(sK15,sK16),tptp0)
    | occurrence_of(sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)),tptp0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06)]) ).

cnf(g10,plain,
    ( ~ min_precedes(sK12(sK15,sK16),sK13(sK15,sK16),tptp0)
    | subactivity_occurrence(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06)]) ).

cnf(g11,plain,
    sPE(tptp0,tptp0),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    sPE(tptp3,tptp3),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ~ sPE(tptp4,tptp3),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39)]) ).

cnf(g14,plain,
    sPE(sK13(sK15,sK16),sK13(sK15,sK16)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ occurrence_of(sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)),tptp0)
    | ~ subactivity_occurrence(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)))
    | ~ arboreal(sK12(sK15,sK16))
    | leaf_occ(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)))
    | next_subocc(sK12(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).

cnf(g16,plain,
    ( ~ occurrence_of(sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)),tptp0)
    | ~ subactivity_occurrence(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)))
    | ~ arboreal(sK12(sK15,sK16))
    | occurrence_of(sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp3)
    | leaf_occ(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).

cnf(g17,plain,
    ( ~ occurrence_of(sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)),tptp0)
    | ~ leaf_occ(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)))
    | ~ min_precedes(sK12(sK15,sK16),sK13(sK15,sK16),tptp0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09)]) ).

cnf(g18,plain,
    ( ~ next_subocc(sK12(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp0)
    | min_precedes(sK12(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_26)]) ).

cnf(g19,plain,
    ( ~ min_precedes(sK12(sK15,sK16),sK13(sK15,sK16),tptp0)
    | ~ min_precedes(sK13(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp0)
    | ~ next_subocc(sK12(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_26)]) ).

cnf(g20,plain,
    ( ~ sPE(sK13(sK15,sK16),sK13(sK15,sK16))
    | ~ sPE(sK14(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))))
    | ~ sPE(tptp0,tptp0)
    | ~ min_precedes(sK13(sK15,sK16),sK14(sK15,sK16),tptp0)
    | min_precedes(sK13(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g21,plain,
    ( ~ sPE(sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),sK14(sK15,sK16))
    | sPE(sK14(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g22,plain,
    ( ~ occurrence_of(sK13(sK15,sK16),tptp4)
    | ~ occurrence_of(sK13(sK15,sK16),tptp3)
    | sPE(tptp4,tptp3) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08)]) ).

cnf(g23,plain,
    ( ~ occurrence_of(sK16,tptp0)
    | ~ subactivity_occurrence(sK15,sK16)
    | ~ min_precedes(sK12(sK15,sK16),sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp0)
    | ~ arboreal(sK15)
    | sPE(sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),sK13(sK15,sK16))
    | sPE(sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),sK14(sK15,sK16))
    | leaf_occ(sK15,sK16) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).

cnf(g24,plain,
    ( ~ sPE(sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),sK13(sK15,sK16))
    | ~ sPE(tptp3,tptp3)
    | ~ occurrence_of(sK12(sK12(sK15,sK16),sK2(tptp0,sK12(sK15,sK16),sK13(sK15,sK16))),tptp3)
    | occurrence_of(sK13(sK15,sK16),tptp3) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : PRO018+4 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.10  % Command  : satcop --statistics %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Mon Jun 13 00:56:11 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 171.25/22.02  % symbols: 45
% 171.25/22.02  % clauses: 130
% 171.25/22.02  % start clauses: 6
% 171.25/22.02  % iterative deepening steps: 3938
% 171.25/22.02  % maximum path limit: 4
% 171.25/22.02  % literal attempts: 67979494
% 171.25/22.02  % depth failures: 59565070
% 171.25/22.02  % regularity failures: 608988
% 171.25/22.02  % tautology failures: 1795971
% 171.25/22.02  % reductions: 2243543
% 171.25/22.02  % extensions: 65715885
% 171.25/22.02  % SAT variables: 1704751
% 171.25/22.02  % SAT clauses: 1916555
% 171.25/22.02  % WalkSAT solutions: 1916536
% 171.25/22.02  % CDCL solutions: 15
% 171.25/22.02  % SZS status Theorem for theBenchmark
% 171.25/22.02  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------