%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRP158-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n011.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 : Sat Jul 16 11:32:31 EDT 2022

% Result   : Unsatisfiable 0.12s 0.35s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(greatest_lower_bound(multiply(c,a),multiply(c,b)),multiply(c,a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono2b)]) ).

cnf(g1,plain,
    ( ~ sPE(greatest_lower_bound(multiply(c,a),multiply(c,b)),multiply(c,greatest_lower_bound(a,b)))
    | ~ sPE(multiply(c,greatest_lower_bound(a,b)),multiply(c,a))
    | sPE(greatest_lower_bound(multiply(c,a),multiply(c,b)),multiply(c,a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    ( ~ sPE(multiply(c,greatest_lower_bound(a,b)),greatest_lower_bound(multiply(c,a),multiply(c,b)))
    | sPE(greatest_lower_bound(multiply(c,a),multiply(c,b)),multiply(c,greatest_lower_bound(a,b))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    sPE(multiply(c,greatest_lower_bound(a,b)),greatest_lower_bound(multiply(c,a),multiply(c,b))),
    inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_glb1)]) ).

cnf(g4,plain,
    ( ~ sPE(c,c)
    | ~ sPE(greatest_lower_bound(a,b),a)
    | sPE(multiply(c,greatest_lower_bound(a,b)),multiply(c,a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    sPE(greatest_lower_bound(a,b),a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono2b_1)]) ).

cnf(g6,plain,
    sPE(c,c),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP158-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 13 08:18:03 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % symbols: 10
% 0.12/0.35  % clauses: 24
% 0.12/0.35  % start clauses: 1
% 0.12/0.35  % iterative deepening steps: 129
% 0.12/0.35  % maximum path limit: 4
% 0.12/0.35  % literal attempts: 2080
% 0.12/0.35  % depth failures: 897
% 0.12/0.35  % regularity failures: 226
% 0.12/0.35  % tautology failures: 135
% 0.12/0.35  % reductions: 0
% 0.12/0.35  % extensions: 1981
% 0.12/0.35  % SAT variables: 942
% 0.12/0.35  % SAT clauses: 1146
% 0.12/0.35  % WalkSAT solutions: 1144
% 0.12/0.35  % CDCL solutions: 0
% 0.12/0.35  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.35  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------