↑ Up

hopCoP---0.1.UNS-CRf.s

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

% Computer : n031.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 04:45:56 PM UTC 2025

% Result   : Unsatisfiable 4.74s 0.99s
% Output   : CNFRefutation 4.74s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named prove_this)

% Comments : 
%------------------------------------------------------------------------------
cnf(9,plain,
    ( ~ less_than(index_of_maximal,successor(an_index))
    | ~ in_array_bounds(array,index_of_maximal)
    | ~ in_array_bounds(array,an_index)
    | maximal_value != array_value_at(array,index_of_maximal)
    | less_than(index_of_maximal,lower_bound)
    | less_than(successor(upper_bound),successor(an_index))
    | less_than(successor(an_index),lower_bound) ),
    inference(cnf,[status(esa)],[prove_this]) ).

cnf(l0,plain,
    ( ~ less_than(index_of_maximal,successor(an_index))
    | ~ in_array_bounds(array,index_of_maximal)
    | ~ in_array_bounds(array,an_index)
    | maximal_value != array_value_at(array,index_of_maximal)
    | less_than(index_of_maximal,lower_bound)
    | less_than(successor(upper_bound),successor(an_index))
    | less_than(successor(an_index),lower_bound) ),
    inference(instantiation,[status(thm)],[9]) ).

cnf(0,plain,
    ( less_than(X0,lower_bound)
    | less_than(upper_bound,X0)
    | in_array_bounds(array,X0) ),
    inference(cnf,[status(esa)],[in_bounds]) ).

cnf(l1,plain,
    ( less_than(an_index,lower_bound)
    | less_than(upper_bound,an_index)
    | in_array_bounds(array,an_index) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(2,plain,
    ( ~ less_than(X0,X1)
    | ~ less_than(X1,X2)
    | less_than(X0,X2) ),
    inference(cnf,[status(esa)],[transitivity_of_less]) ).

cnf(l3,plain,
    ( ~ less_than(an_index,successor(an_index))
    | ~ less_than(successor(an_index),lower_bound)
    | less_than(an_index,lower_bound) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(6,plain,
    ~ less_than(an_index,lower_bound),
    inference(cnf,[status(esa)],[somewhere_above_lower_bound]) ).

cnf(l15,plain,
    ~ less_than(an_index,lower_bound),
    inference(instantiation,[status(thm)],[6]) ).

cnf(l209,plain,
    ~ less_than(an_index,lower_bound),
    inference(instantiation,[status(thm)],[6]) ).

cnf(8,plain,
    ~ less_than(index_of_maximal,lower_bound),
    inference(cnf,[status(esa)],[maximal_above_lower_bound]) ).

cnf(l7,plain,
    ~ less_than(index_of_maximal,lower_bound),
    inference(instantiation,[status(thm)],[8]) ).

cnf(l6,plain,
    ( less_than(index_of_maximal,lower_bound)
    | less_than(upper_bound,index_of_maximal)
    | in_array_bounds(array,index_of_maximal) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(1,plain,
    ( ~ less_than(successor(X0),successor(X1))
    | less_than(X0,X1) ),
    inference(cnf,[status(esa)],[predecessor_less]) ).

cnf(l24,plain,
    ( ~ less_than(successor(upper_bound),successor(an_index))
    | less_than(upper_bound,an_index) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l23,plain,
    ~ less_than(index_of_maximal,lower_bound),
    inference(instantiation,[status(thm)],[8]) ).

cnf(4,plain,
    ( ~ in_array_bounds(array,index_of_maximal)
    | maximal_value = array_value_at(array,index_of_maximal) ),
    inference(cnf,[status(esa)],[this_is_maximal]) ).

cnf(l12,plain,
    ( ~ in_array_bounds(array,index_of_maximal)
    | maximal_value = array_value_at(array,index_of_maximal) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(l47,plain,
    ( ~ less_than(successor(an_index),successor(successor(an_index)))
    | less_than(an_index,successor(an_index)) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l2,plain,
    ( ~ less_than(index_of_maximal,an_index)
    | ~ less_than(an_index,successor(an_index))
    | less_than(index_of_maximal,successor(an_index)) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l22,plain,
    ( less_than(index_of_maximal,lower_bound)
    | less_than(upper_bound,index_of_maximal)
    | in_array_bounds(array,index_of_maximal) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l18,plain,
    ( ~ less_than(upper_bound,index_of_maximal)
    | ~ less_than(index_of_maximal,an_index)
    | less_than(upper_bound,an_index) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l34,plain,
    ( ~ less_than(upper_bound,index_of_maximal)
    | ~ less_than(index_of_maximal,an_index)
    | less_than(upper_bound,an_index) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(7,plain,
    ~ less_than(upper_bound,an_index),
    inference(cnf,[status(esa)],[somewhere_below_upper_bound]) ).

cnf(l10,plain,
    ~ less_than(upper_bound,an_index),
    inference(instantiation,[status(thm)],[7]) ).

cnf(5,plain,
    less_than(index_of_maximal,an_index),
    inference(cnf,[status(esa)],[maximal_before_somewhere]) ).

cnf(l278,plain,
    less_than(index_of_maximal,an_index),
    inference(instantiation,[status(thm)],[5]) ).

cnf(l155,plain,
    ~ less_than(upper_bound,an_index),
    inference(instantiation,[status(thm)],[7]) ).

cnf(l36,plain,
    ~ less_than(upper_bound,an_index),
    inference(instantiation,[status(thm)],[7]) ).

cnf(l26,plain,
    ~ less_than(index_of_maximal,lower_bound),
    inference(instantiation,[status(thm)],[8]) ).

cnf(l35,plain,
    ~ less_than(upper_bound,an_index),
    inference(instantiation,[status(thm)],[7]) ).

cnf(3,plain,
    less_than(X0,successor(X0)),
    inference(cnf,[status(esa)],[successor_greater]) ).

cnf(l50,plain,
    less_than(successor(an_index),successor(successor(an_index))),
    inference(instantiation,[status(thm)],[3]) ).

cnf(l38,plain,
    less_than(index_of_maximal,an_index),
    inference(instantiation,[status(thm)],[5]) ).

cnf(l8,plain,
    less_than(index_of_maximal,an_index),
    inference(instantiation,[status(thm)],[5]) ).

cnf(l30,plain,
    less_than(an_index,successor(an_index)),
    inference(instantiation,[status(thm)],[3]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l3,l15,l209,l7,l6,l24,l23,l12,l47,l2,l22,l18,l34,l10,l278,l155,l36,l26,l35,l50,l38,l8,l30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV019-1 : TPTP v9.0.0. Released v2.4.0.
% 0.07/0.12  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33  % Computer : n031.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 : Tue Jul 22 08:00:34 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % launching worker at depth: 1
% 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: 3
% 0.12/0.34  % launching worker at depth: 2
% 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.12/0.37  % launching worker at depth: 11
% 4.74/0.99  % SZS status Theorem for theBenchmark
% 4.74/0.99  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------