↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET020-7 : 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 : 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  : 300s
% DateTime : Fri Jul 25 03:31:09 PM UTC 2025

% Result   : Unsatisfiable 17.37s 2.58s
% Output   : CNFRefutation 17.37s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named prove_unique_1st_and_2nd_in_pair_of_sets1_1)

% Comments : 
%------------------------------------------------------------------------------
cnf(157,plain,
    member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
    inference(cnf,[status(esa)],[prove_unique_1st_and_2nd_in_pair_of_sets1_1]) ).

cnf(l0,plain,
    member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
    inference(instantiation,[status(thm)],[157]) ).

cnf(6,plain,
    ( ~ subclass(X0,X1)
    | ~ subclass(X1,X0)
    | X0 = X1 ),
    inference(cnf,[status(esa)],[subclass_implies_equal]) ).

cnf(l41,plain,
    ( ~ subclass(ordered_pair(u,v),ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))))
    | ~ subclass(ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))),ordered_pair(u,v))
    | ordered_pair(u,v) = ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(16,plain,
    ( ~ member(X0,cross_product(X1,X2))
    | ordered_pair(first(X0),second(X0)) = X0 ),
    inference(cnf,[status(esa)],[cartesian_product4]) ).

cnf(l44,plain,
    ( ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class))
    | ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) = ordered_pair(u,v) ),
    inference(instantiation,[status(thm)],[16]) ).

cnf(95,plain,
    subclass(X0,X0),
    inference(cnf,[status(esa)],[subclass_is_reflexive]) ).

cnf(l48,plain,
    subclass(ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))),ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v)))),
    inference(instantiation,[status(thm)],[95]) ).

cnf(l57,plain,
    ( ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class))
    | ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) = ordered_pair(u,v) ),
    inference(instantiation,[status(thm)],[16]) ).

cnf(13,plain,
    ( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
    | member(X0,X2) ),
    inference(cnf,[status(esa)],[cartesian_product1]) ).

cnf(l40,plain,
    ( ~ member(ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))),cross_product(universal_class,universal_class))
    | member(first(ordered_pair(u,v)),universal_class) ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(l61,plain,
    subclass(ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))),ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v)))),
    inference(instantiation,[status(thm)],[95]) ).

cnf(150,plain,
    ( ~ member(X0,universal_class)
    | ordered_pair(X0,X1) != ordered_pair(X2,X3)
    | X0 = X2 ),
    inference(cnf,[status(esa)],[ordered_pair_determines_components1]) ).

cnf(l42,plain,
    ( ~ member(first(ordered_pair(u,v)),universal_class)
    | ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) != ordered_pair(u,v)
    | first(ordered_pair(u,v)) = u ),
    inference(instantiation,[status(thm)],[150]) ).

cnf(158,plain,
    first(ordered_pair(u,v)) != u,
    inference(cnf,[status(esa)],[prove_unique_1st_and_2nd_in_pair_of_sets1_2]) ).

cnf(l53,plain,
    first(ordered_pair(u,v)) != u,
    inference(instantiation,[status(thm)],[158]) ).

cnf(l52,plain,
    ( ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class))
    | ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) = ordered_pair(u,v) ),
    inference(instantiation,[status(thm)],[16]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l41,l44,l48,l57,l40,l61,l42,l53,l52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET020-7 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.11/0.12  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 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  : 300
% 0.12/0.33  % DateTime : Mon Jul 21 19:20:19 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % launching worker at depth: 1
% 0.12/0.34  % launching worker at depth: 5
% 0.12/0.34  % launching worker at depth: 6
% 0.12/0.34  % launching worker at depth: 2
% 0.12/0.34  % launching worker at depth: 4
% 0.12/0.34  % launching worker at depth: 3
% 0.12/0.34  % launching worker at depth: 7
% 0.12/0.34  % launching worker at depth: 8
% 0.12/0.34  % launching worker at depth: 9
% 0.12/0.37  % launching worker at depth: 10
% 4.77/1.00  % launching worker at depth: 11
% 17.37/2.58  % SZS status Theorem for theBenchmark
% 17.37/2.58  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------