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

% Computer : n015.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:33 EDT 2022

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(g17,plain,
    sPE(least_upper_bound(a,identity),a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lat1a_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GRP165-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n015.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jun 14 02:46:53 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.39  % symbols: 8
% 0.20/0.40  % clauses: 24
% 0.20/0.40  % start clauses: 1
% 0.20/0.40  % iterative deepening steps: 374
% 0.20/0.40  % maximum path limit: 7
% 0.20/0.40  % literal attempts: 10962
% 0.20/0.40  % depth failures: 3389
% 0.20/0.40  % regularity failures: 1166
% 0.20/0.40  % tautology failures: 770
% 0.20/0.40  % reductions: 0
% 0.20/0.40  % extensions: 10840
% 0.20/0.40  % SAT variables: 5788
% 0.20/0.40  % SAT clauses: 8548
% 0.20/0.40  % WalkSAT solutions: 8545
% 0.20/0.40  % CDCL solutions: 0
% 0.20/0.40  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------