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

% Computer : n017.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:34 EDT 2022

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

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

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

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

cnf(g3,plain,
    sPE(a,a),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g6,plain,
    sPE(multiply(identity,a),a),
    inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',left_identity)]) ).

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP166-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Tue Jun 14 01:15:53 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.37  % symbols: 9
% 0.14/0.37  % clauses: 25
% 0.14/0.37  % start clauses: 1
% 0.14/0.37  % iterative deepening steps: 479
% 0.14/0.37  % maximum path limit: 5
% 0.14/0.37  % literal attempts: 16433
% 0.14/0.37  % depth failures: 6060
% 0.14/0.37  % regularity failures: 1866
% 0.14/0.37  % tautology failures: 1310
% 0.14/0.37  % reductions: 0
% 0.14/0.37  % extensions: 16072
% 0.14/0.37  % SAT variables: 5790
% 0.14/0.37  % SAT clauses: 8635
% 0.14/0.37  % WalkSAT solutions: 8635
% 0.14/0.37  % CDCL solutions: 0
% 0.14/0.37  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------