↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET025-8 : TPTP v9.0.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n029.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:11 PM UTC 2025

% Result   : Unsatisfiable 10.78s 1.72s
% Output   : CNFRefutation 10.78s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named prove_predicate_is_small)

% Comments : 
%------------------------------------------------------------------------------
cnf(152,plain,
    ~ little_set(a),
    inference(cnf,[status(esa)],[prove_predicate_is_small]) ).

cnf(l0,plain,
    ~ little_set(a),
    inference(instantiation,[status(thm)],[152]) ).

cnf(12,plain,
    ( ~ ordered_pair_predicate(X0)
    | X0 = ordered_pair(f2(X0),f3(X0)) ),
    inference(cnf,[status(esa)],[ordered_pair_predicate3]) ).

cnf(l3,plain,
    ( ~ ordered_pair_predicate(a)
    | a = ordered_pair(f2(a),f3(a)) ),
    inference(instantiation,[status(thm)],[12]) ).

cnf(151,plain,
    ordered_pair_predicate(a),
    inference(cnf,[status(esa)],[an_ordered_pair_predicate]) ).

cnf(l8,plain,
    ordered_pair_predicate(a),
    inference(instantiation,[status(thm)],[151]) ).

cnf(7,plain,
    little_set(non_ordered_pair(X0,X1)),
    inference(cnf,[status(esa)],[non_ordered_pair4]) ).

cnf(l48,plain,
    little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))),
    inference(instantiation,[status(thm)],[7]) ).

cnf(9,plain,
    ordered_pair(X0,X1) = non_ordered_pair(singleton_set(X0),non_ordered_pair(X0,X1)),
    inference(cnf,[status(esa)],[ordered_pair]) ).

cnf(l41,plain,
    ordered_pair(f2(a),f3(a)) = non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))),
    inference(instantiation,[status(thm)],[9]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l3,l8,l48,l41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET025-8 : TPTP v9.0.0. Released v1.0.0.
% 0.03/0.12  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33  % Computer : n029.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:23:34 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % launching worker at depth: 2
% 0.12/0.34  % launching worker at depth: 1
% 0.12/0.34  % launching worker at depth: 3
% 0.12/0.34  % launching worker at depth: 4
% 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: 7
% 0.12/0.34  % launching worker at depth: 8
% 0.12/0.34  % launching worker at depth: 9
% 0.12/0.34  % launching worker at depth: 10
% 0.18/0.37  % launching worker at depth: 11
% 10.78/1.72  % SZS status Theorem for theBenchmark
% 10.78/1.72  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------