↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : FLD003-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n028.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  : 300s
% DateTime : Thu Jul 24 11:55:12 AM UTC 2025

% Result   : Unsatisfiable 0.12s 0.38s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named add_not_equal_to_a_3)

% Comments : 
%------------------------------------------------------------------------------
cnf(29,plain,
    ~ equalish(add(a,add(b,additive_inverse(b))),a),
    inference(cnf,[status(esa)],[add_not_equal_to_a_3]) ).

cnf(l0,plain,
    ~ equalish(add(a,add(b,additive_inverse(b))),a),
    inference(instantiation,[status(thm)],[29]) ).

cnf(22,plain,
    ( ~ equalish(X0,X1)
    | ~ equalish(X1,X2)
    | equalish(X0,X2) ),
    inference(cnf,[status(esa)],[transitivity_of_equality]) ).

cnf(l1,plain,
    ( ~ equalish(add(a,add(b,additive_inverse(b))),add(add(b,additive_inverse(b)),a))
    | ~ equalish(add(add(b,additive_inverse(b)),a),a)
    | equalish(add(a,add(b,additive_inverse(b))),a) ),
    inference(instantiation,[status(thm)],[22]) ).

cnf(3,plain,
    ( ~ defined(X0)
    | ~ defined(X1)
    | equalish(add(X0,X1),add(X1,X0)) ),
    inference(cnf,[status(esa)],[commutativity_addition]) ).

cnf(l2,plain,
    ( ~ defined(a)
    | ~ defined(add(b,additive_inverse(b)))
    | equalish(add(a,add(b,additive_inverse(b))),add(add(b,additive_inverse(b)),a)) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(9,plain,
    ( ~ defined(X0)
    | ~ defined(X1)
    | defined(add(X0,X1)) ),
    inference(cnf,[status(esa)],[well_definedness_of_addition]) ).

cnf(l4,plain,
    ( ~ defined(b)
    | ~ defined(additive_inverse(b))
    | defined(add(b,additive_inverse(b))) ),
    inference(instantiation,[status(thm)],[9]) ).

cnf(11,plain,
    ( ~ defined(X0)
    | defined(additive_inverse(X0)) ),
    inference(cnf,[status(esa)],[well_definedness_of_additive_inverse]) ).

cnf(l8,plain,
    ( ~ defined(b)
    | defined(additive_inverse(b)) ),
    inference(instantiation,[status(thm)],[11]) ).

cnf(27,plain,
    defined(a),
    inference(cnf,[status(esa)],[a_is_defined]) ).

cnf(l3,plain,
    defined(a),
    inference(instantiation,[status(thm)],[27]) ).

cnf(28,plain,
    defined(b),
    inference(cnf,[status(esa)],[b_is_defined]) ).

cnf(l27,plain,
    defined(b),
    inference(instantiation,[status(thm)],[28]) ).

cnf(l5,plain,
    defined(b),
    inference(instantiation,[status(thm)],[28]) ).

cnf(l36,plain,
    ( ~ equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a))
    | ~ equalish(add(additive_identity,a),a)
    | equalish(add(add(b,additive_inverse(b)),a),a) ),
    inference(instantiation,[status(thm)],[22]) ).

cnf(23,plain,
    ( ~ defined(X0)
    | ~ equalish(X1,X2)
    | equalish(add(X1,X0),add(X2,X0)) ),
    inference(cnf,[status(esa)],[compatibility_of_equality_and_addition]) ).

cnf(l37,plain,
    ( ~ defined(a)
    | ~ equalish(add(b,additive_inverse(b)),additive_identity)
    | equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a)) ),
    inference(instantiation,[status(thm)],[23]) ).

cnf(1,plain,
    ( ~ defined(X0)
    | equalish(add(additive_identity,X0),X0) ),
    inference(cnf,[status(esa)],[existence_of_identity_addition]) ).

cnf(l42,plain,
    ( ~ defined(a)
    | equalish(add(additive_identity,a),a) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l58,plain,
    defined(a),
    inference(instantiation,[status(thm)],[27]) ).

cnf(l41,plain,
    defined(a),
    inference(instantiation,[status(thm)],[27]) ).

cnf(2,plain,
    ( ~ defined(X0)
    | equalish(add(X0,additive_inverse(X0)),additive_identity) ),
    inference(cnf,[status(esa)],[existence_of_inverse_addition]) ).

cnf(l38,plain,
    ( ~ defined(b)
    | equalish(add(b,additive_inverse(b)),additive_identity) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l45,plain,
    defined(b),
    inference(instantiation,[status(thm)],[28]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l4,l8,l3,l27,l5,l36,l37,l42,l58,l41,l38,l45]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : FLD003-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.10/0.12  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Sun Jul 20 09:32:19 EDT 2025
% 0.12/0.32  % CPUTime  : 
% 0.12/0.33  % launching worker at depth: 1
% 0.12/0.33  % launching worker at depth: 8
% 0.12/0.33  % launching worker at depth: 2
% 0.12/0.33  % launching worker at depth: 5
% 0.12/0.33  % launching worker at depth: 6
% 0.12/0.33  % launching worker at depth: 3
% 0.12/0.33  % launching worker at depth: 7
% 0.12/0.33  % launching worker at depth: 4
% 0.12/0.33  % launching worker at depth: 9
% 0.12/0.33  % launching worker at depth: 10
% 0.12/0.33  % launching worker at depth: 11
% 0.12/0.35  % launching worker at depth: 12
% 0.12/0.38  % SZS status Theorem for theBenchmark
% 0.12/0.38  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------