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

% Computer : n003.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 1.35s 0.56s
% Output   : Proof 1.35s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

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

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

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

cnf(g5,plain,
    sPE(least_upper_bound(a,b),b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_mono1c_1)]) ).

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13  % Command  : satcop --statistics %s
% 0.13/0.33  % Computer : n003.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun 14 13:30:10 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.35/0.56  % symbols: 10
% 1.35/0.56  % clauses: 24
% 1.35/0.56  % start clauses: 1
% 1.35/0.56  % iterative deepening steps: 1567
% 1.35/0.56  % maximum path limit: 5
% 1.35/0.56  % literal attempts: 106412
% 1.35/0.56  % depth failures: 40154
% 1.35/0.56  % regularity failures: 12053
% 1.35/0.56  % tautology failures: 7893
% 1.35/0.56  % reductions: 0
% 1.35/0.56  % extensions: 104851
% 1.35/0.56  % SAT variables: 34263
% 1.35/0.56  % SAT clauses: 51579
% 1.35/0.56  % WalkSAT solutions: 51575
% 1.35/0.56  % CDCL solutions: 0
% 1.35/0.56  % SZS status Unsatisfiable for theBenchmark
% 1.35/0.56  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------