%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRP176-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : Sat Jul 16 11:32:39 EDT 2022

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

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

cnf(g1,plain,
    sPE(multiply(least_upper_bound(a,b),d),least_upper_bound(multiply(a,d),multiply(b,d))),
    inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_lub2)]) ).

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

cnf(g3,plain,
    ( ~ sPE(c,c)
    | ~ sPE(multiply(least_upper_bound(a,b),d),least_upper_bound(multiply(a,d),multiply(b,d)))
    | sPE(multiply(c,multiply(least_upper_bound(a,b),d)),multiply(c,least_upper_bound(multiply(a,d),multiply(b,d)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g5,plain,
    sPE(multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))),least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d)))),
    inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',monotony_lub1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09  % Problem  : GRP176-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.10  % Command  : satcop --statistics %s
% 0.10/0.28  % Computer : n032.cluster.edu
% 0.10/0.28  % Model    : x86_64 x86_64
% 0.10/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28  % Memory   : 8042.1875MB
% 0.10/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28  % CPULimit : 300
% 0.10/0.28  % WCLimit  : 600
% 0.10/0.28  % DateTime : Mon Jun 13 17:37:12 EDT 2022
% 0.10/0.28  % CPUTime  : 
% 0.10/0.29  % symbols: 11
% 0.10/0.29  % clauses: 24
% 0.10/0.29  % start clauses: 1
% 0.10/0.29  % iterative deepening steps: 65
% 0.10/0.29  % maximum path limit: 4
% 0.10/0.29  % literal attempts: 815
% 0.10/0.29  % depth failures: 349
% 0.10/0.29  % regularity failures: 84
% 0.10/0.29  % tautology failures: 65
% 0.10/0.29  % reductions: 0
% 0.10/0.29  % extensions: 752
% 0.10/0.29  % SAT variables: 524
% 0.10/0.29  % SAT clauses: 562
% 0.10/0.29  % WalkSAT solutions: 555
% 0.10/0.29  % CDCL solutions: 0
% 0.10/0.29  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.29  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------