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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRP671-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

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

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

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

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

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

cnf(g3,plain,
    sPE(mult(rd(mult(mult(a,b),a),a),a),mult(mult(a,b),a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03)]) ).

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

cnf(g5,plain,
    sPE(rd(mult(mult(a,b),a),a),mult(a,b)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04)]) ).

cnf(g6,plain,
    sPE(mult(unit,mult(a,b)),mult(a,b)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06)]) ).

cnf(g7,plain,
    ( ~ sPE(rd(mult(mult(a,b),a),a),mult(a,b))
    | sPE(mult(a,b),rd(mult(mult(a,b),a),a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    sPE(mult(mult(unit,mult(a,b)),unit),mult(unit,mult(a,b))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05)]) ).

cnf(g9,plain,
    ( ~ sPE(mult(a,mult(b,a)),mult(mult(mult(unit,mult(a,b)),unit),a))
    | ~ sPE(mult(mult(mult(unit,mult(a,b)),unit),a),mult(mult(a,b),a))
    | sPE(mult(a,mult(b,a)),mult(mult(a,b),a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(mult(a,mult(b,a)),mult(mult(unit,a),mult(b,mult(unit,a))))
    | ~ sPE(mult(mult(unit,a),mult(b,mult(unit,a))),mult(mult(mult(unit,mult(a,b)),unit),a))
    | sPE(mult(a,mult(b,a)),mult(mult(mult(unit,mult(a,b)),unit),a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(a,mult(unit,a))
    | ~ sPE(mult(b,a),mult(b,mult(unit,a)))
    | sPE(mult(a,mult(b,a)),mult(mult(unit,a),mult(b,mult(unit,a)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(b,b)
    | ~ sPE(a,mult(unit,a))
    | sPE(mult(b,a),mult(b,mult(unit,a))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    sPE(mult(mult(unit,a),mult(b,mult(unit,a))),mult(mult(mult(unit,mult(a,b)),unit),a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09)]) ).

cnf(g14,plain,
    ( ~ sPE(mult(mult(mult(unit,mult(a,b)),unit),a),mult(rd(mult(mult(a,b),a),a),a))
    | ~ sPE(mult(rd(mult(mult(a,b),a),a),a),mult(mult(a,b),a))
    | sPE(mult(mult(mult(unit,mult(a,b)),unit),a),mult(mult(a,b),a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(mult(mult(unit,mult(a,b)),unit),rd(mult(mult(a,b),a),a))
    | ~ sPE(a,a)
    | sPE(mult(mult(mult(unit,mult(a,b)),unit),a),mult(rd(mult(mult(a,b),a),a),a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ sPE(mult(mult(unit,mult(a,b)),unit),mult(unit,mult(a,b)))
    | ~ sPE(mult(unit,mult(a,b)),rd(mult(mult(a,b),a),a))
    | sPE(mult(mult(unit,mult(a,b)),unit),rd(mult(mult(a,b),a),a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(mult(unit,mult(a,b)),mult(a,b))
    | ~ sPE(mult(a,b),rd(mult(mult(a,b),a),a))
    | sPE(mult(unit,mult(a,b)),rd(mult(mult(a,b),a),a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g18,plain,
    sPE(mult(unit,a),a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06)]) ).

cnf(g19,plain,
    ( ~ sPE(mult(unit,a),a)
    | sPE(a,mult(unit,a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP671-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 13 08:41:13 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 18.70/2.67  % symbols: 9
% 18.70/2.67  % clauses: 17
% 18.70/2.67  % start clauses: 1
% 18.70/2.67  % iterative deepening steps: 4554
% 18.70/2.67  % maximum path limit: 18
% 18.70/2.67  % literal attempts: 719262
% 18.70/2.67  % depth failures: 188861
% 18.70/2.67  % regularity failures: 83996
% 18.70/2.67  % tautology failures: 55855
% 18.70/2.67  % reductions: 0
% 18.70/2.67  % extensions: 718932
% 18.70/2.67  % SAT variables: 561058
% 18.70/2.67  % SAT clauses: 796612
% 18.70/2.67  % WalkSAT solutions: 796611
% 18.70/2.67  % CDCL solutions: 0
% 18.70/2.67  % SZS status Unsatisfiable for theBenchmark
% 18.70/2.67  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------