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

% Computer : n025.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 : Mon Jul 18 20:55:55 EDT 2022

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

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

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

cnf(g2,plain,
    ( ~ sPE(add(negate(b),negate(a)),add(negate(a),negate(b)))
    | sPE(negate(add(negate(b),negate(a))),negate(add(negate(a),negate(b)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    sPE(add(negate(b),negate(a)),add(negate(a),negate(b))),
    inference(ground_cnf,[],[file('Axioms/ROB001-0.ax',commutativity_of_add)]) ).

cnf(g4,plain,
    ( ~ sPE(add(negate(b),a),add(a,negate(b)))
    | sPE(negate(add(negate(b),a)),negate(add(a,negate(b)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    sPE(add(negate(b),a),add(a,negate(b))),
    inference(ground_cnf,[],[file('Axioms/ROB001-0.ax',commutativity_of_add)]) ).

cnf(g6,plain,
    ( ~ sPE(b,add(negate(add(negate(b),a)),negate(add(negate(b),negate(a)))))
    | ~ sPE(add(negate(add(negate(b),a)),negate(add(negate(b),negate(a)))),add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))))
    | sPE(b,add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g8,plain,
    ( ~ sPE(add(negate(add(negate(b),a)),negate(add(negate(b),negate(a)))),b)
    | sPE(b,add(negate(add(negate(b),a)),negate(add(negate(b),negate(a))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(negate(add(negate(add(negate(b),a)),negate(add(negate(b),negate(a))))),negate(b))
    | sPE(add(negate(add(negate(b),a)),negate(add(negate(b),negate(a)))),b) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',negative_equality_implies_positive_equality)]) ).

cnf(g10,plain,
    sPE(negate(add(negate(add(negate(b),a)),negate(add(negate(b),negate(a))))),negate(b)),
    inference(ground_cnf,[],[file('Axioms/ROB001-0.ax',robbins_axiom)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : ROB021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n025.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 : Thu Jun  9 15:02:20 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.40  % symbols: 6
% 0.18/0.40  % clauses: 10
% 0.18/0.40  % start clauses: 1
% 0.18/0.40  % iterative deepening steps: 334
% 0.18/0.40  % maximum path limit: 7
% 0.18/0.40  % literal attempts: 27787
% 0.18/0.40  % depth failures: 14242
% 0.18/0.40  % regularity failures: 4308
% 0.18/0.40  % tautology failures: 1856
% 0.18/0.40  % reductions: 0
% 0.18/0.40  % extensions: 27673
% 0.18/0.40  % SAT variables: 7380
% 0.18/0.40  % SAT clauses: 11480
% 0.18/0.40  % WalkSAT solutions: 11477
% 0.18/0.40  % CDCL solutions: 0
% 0.18/0.40  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------