TSTP Solution File: GRP022-2 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRP022-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n012.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:31:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(inverse(inverse(a)),a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse_of_inverse_is_original)]) ).

cnf(g1,plain,
    sPE(multiply(a,identity),a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity)]) ).

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

cnf(g3,plain,
    sPE(multiply(inverse(inverse(a)),identity),inverse(inverse(a))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity)]) ).

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

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

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

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

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

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

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

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

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

cnf(g13,plain,
    sPE(multiply(multiply(inverse(inverse(a)),inverse(a)),a),multiply(inverse(inverse(a)),multiply(inverse(a),a))),
    inference(ground_cnf,[],[file('Axioms/GRP004-0.ax',associativity)]) ).

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GRP022-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.14/0.34  % Computer : n012.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.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue Jun 14 14:00:55 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 6.60/1.26  % symbols: 6
% 6.60/1.26  % clauses: 11
% 6.60/1.26  % start clauses: 1
% 6.60/1.26  % iterative deepening steps: 2725
% 6.60/1.26  % maximum path limit: 8
% 6.60/1.26  % literal attempts: 563753
% 6.60/1.26  % depth failures: 165202
% 6.60/1.26  % regularity failures: 70648
% 6.60/1.26  % tautology failures: 61156
% 6.60/1.26  % reductions: 0
% 6.60/1.26  % extensions: 561051
% 6.60/1.26  % SAT variables: 177121
% 6.60/1.26  % SAT clauses: 298917
% 6.60/1.26  % WalkSAT solutions: 298916
% 6.60/1.26  % CDCL solutions: 0
% 6.60/1.26  % SZS status Unsatisfiable for theBenchmark
% 6.60/1.26  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------