TSTP Solution File: GRP533-1 by SATCoP---0.1

View Problem - Process Solution 
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRP533-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(multiply(inverse(a1),a1),multiply(inverse(b1),b1)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1)]) ).

cnf(g1,plain,
    sPE(multiply(inverse(a1),a1),divide(inverse(a1),divide(divide(a1,a1),a1))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply)]) ).

cnf(g2,plain,
    sPE(multiply(inverse(b1),b1),divide(inverse(b1),divide(divide(a1,a1),b1))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply)]) ).

cnf(g3,plain,
    sPE(inverse(a1),divide(divide(a1,a1),a1)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse)]) ).

cnf(g4,plain,
    sPE(inverse(b1),divide(divide(a1,a1),b1)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse)]) ).

cnf(g5,plain,
    ( ~ sPE(divide(inverse(b1),divide(divide(a1,a1),b1)),multiply(inverse(a1),a1))
    | sPE(multiply(inverse(a1),a1),divide(inverse(b1),divide(divide(a1,a1),b1))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    sPE(divide(divide(a1,a1),a1),divide(divide(a1,a1),a1)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( ~ sPE(multiply(inverse(b1),b1),divide(inverse(b1),divide(divide(a1,a1),b1)))
    | sPE(divide(inverse(b1),divide(divide(a1,a1),b1)),multiply(inverse(b1),b1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(multiply(inverse(a1),a1),divide(divide(divide(a1,a1),b1),divide(divide(a1,a1),b1)))
    | sPE(divide(divide(divide(a1,a1),b1),divide(divide(a1,a1),b1)),multiply(inverse(a1),a1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(multiply(inverse(a1),a1),divide(inverse(b1),divide(divide(a1,a1),b1)))
    | ~ sPE(divide(inverse(b1),divide(divide(a1,a1),b1)),multiply(inverse(b1),b1))
    | sPE(multiply(inverse(a1),a1),multiply(inverse(b1),b1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(inverse(a1),divide(divide(a1,a1),a1))
    | ~ sPE(divide(divide(a1,a1),a1),divide(divide(a1,a1),a1))
    | sPE(divide(inverse(a1),divide(divide(a1,a1),a1)),divide(divide(divide(a1,a1),a1),divide(divide(a1,a1),a1))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    sPE(divide(divide(a1,a1),b1),divide(divide(a1,a1),b1)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(divide(inverse(b1),divide(divide(a1,a1),b1)),divide(divide(divide(a1,a1),b1),divide(divide(a1,a1),b1)))
    | ~ sPE(divide(divide(divide(a1,a1),b1),divide(divide(a1,a1),b1)),multiply(inverse(a1),a1))
    | sPE(divide(inverse(b1),divide(divide(a1,a1),b1)),multiply(inverse(a1),a1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ sPE(inverse(b1),divide(divide(a1,a1),b1))
    | ~ sPE(divide(divide(a1,a1),b1),divide(divide(a1,a1),b1))
    | sPE(divide(inverse(b1),divide(divide(a1,a1),b1)),divide(divide(divide(a1,a1),b1),divide(divide(a1,a1),b1))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g15,plain,
    ( ~ sPE(divide(inverse(a1),divide(divide(a1,a1),a1)),divide(divide(divide(a1,a1),a1),divide(divide(a1,a1),a1)))
    | ~ sPE(divide(divide(divide(a1,a1),a1),divide(divide(a1,a1),a1)),identity)
    | sPE(divide(inverse(a1),divide(divide(a1,a1),a1)),identity) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

cnf(g19,plain,
    sPE(identity,divide(divide(divide(a1,a1),b1),divide(divide(a1,a1),b1))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : GRP533-1 : TPTP v8.1.0. Released v2.6.0.
% 0.09/0.15  % Command  : satcop --statistics %s
% 0.15/0.36  % Computer : n018.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Tue Jun 14 04:21:28 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.23/0.50  % symbols: 8
% 0.23/0.50  % clauses: 11
% 0.23/0.50  % start clauses: 1
% 0.23/0.50  % iterative deepening steps: 700
% 0.23/0.50  % maximum path limit: 6
% 0.23/0.50  % literal attempts: 77329
% 0.23/0.50  % depth failures: 32305
% 0.23/0.50  % regularity failures: 8384
% 0.23/0.50  % tautology failures: 7765
% 0.23/0.50  % reductions: 0
% 0.23/0.50  % extensions: 76769
% 0.23/0.50  % SAT variables: 16174
% 0.23/0.50  % SAT clauses: 25221
% 0.23/0.50  % WalkSAT solutions: 25220
% 0.23/0.50  % CDCL solutions: 0
% 0.23/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.23/0.50  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------