%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SWV374+1 : TPTP v8.1.0. Released v3.3.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 : Wed Jul 20 21:28:48 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l10_co)]) ).

cnf(g1,plain,
    ( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
    | ~ contains_slb(sK1,findmin_pqp_res(sK0))
    | sPE(sK1,create_slb) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l10_co)]) ).

cnf(g2,plain,
    ( less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+0.ax',totality)]) ).

cnf(g3,plain,
    ( ~ less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
    | strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+0.ax',stricly_smaller_definition)]) ).

cnf(g4,plain,
    ( ~ sPE(findmin_cpq_eff(triple(sK0,sK1,sK2)),triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
    | ~ ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
    | ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    ( ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
    | ~ contains_slb(sK1,findmin_pqp_res(sK0))
    | sPE(sK1,create_slb)
    | sPE(findmin_cpq_eff(triple(sK0,sK1,sK2)),triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax48)]) ).

cnf(g6,plain,
    ( sPE(sK1,create_slb)
    | sPE(findmin_cpq_eff(triple(sK0,sK1,sK2)),triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
    | contains_slb(sK1,findmin_pqp_res(sK0)) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax47)]) ).

cnf(g7,plain,
    ~ ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax40)]) ).

cnf(g8,plain,
    ~ ok(triple(sK0,create_slb,bad)),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax40)]) ).

cnf(g9,plain,
    sPE(sK0,sK0),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    sPE(sK2,sK2),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_cpq_eff(triple(sK0,create_slb,sK2)))
    | ~ ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
    | ok(findmin_cpq_eff(triple(sK0,create_slb,sK2))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(findmin_cpq_eff(triple(sK0,create_slb,sK2)),triple(sK0,create_slb,bad))
    | ~ ok(findmin_cpq_eff(triple(sK0,create_slb,sK2)))
    | ok(triple(sK0,create_slb,bad)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    sPE(findmin_cpq_eff(triple(sK0,create_slb,sK2)),triple(sK0,create_slb,bad)),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax46)]) ).

cnf(g14,plain,
    ( ~ sPE(triple(sK0,sK1,sK2),triple(sK0,create_slb,sK2))
    | sPE(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_cpq_eff(triple(sK0,create_slb,sK2))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(sK0,sK0)
    | ~ sPE(sK1,create_slb)
    | ~ sPE(sK2,sK2)
    | sPE(triple(sK0,sK1,sK2),triple(sK0,create_slb,sK2)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08  % Problem  : SWV374+1 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.09  % Command  : satcop --statistics %s
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 600
% 0.08/0.28  % DateTime : Wed Jun 15 18:19:14 EDT 2022
% 0.08/0.28  % CPUTime  : 
% 18.93/2.67  % symbols: 32
% 18.93/2.67  % clauses: 79
% 18.93/2.67  % start clauses: 2
% 18.93/2.67  % iterative deepening steps: 2483
% 18.93/2.67  % maximum path limit: 4
% 18.93/2.67  % literal attempts: 4522982
% 18.93/2.67  % depth failures: 4234541
% 18.93/2.67  % regularity failures: 29828
% 18.93/2.67  % tautology failures: 20737
% 18.93/2.67  % reductions: 22278
% 18.93/2.67  % extensions: 4499117
% 18.93/2.67  % SAT variables: 989141
% 18.93/2.67  % SAT clauses: 903265
% 18.93/2.67  % WalkSAT solutions: 903247
% 18.93/2.67  % CDCL solutions: 19
% 18.93/2.67  % SZS status Theorem for theBenchmark
% 18.93/2.67  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------