TSTP Solution File: SWV019-1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWV019-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n015.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 May 9 17:44:07 EDT 2024
% Result : Unsatisfiable 87.98s 88.19s
% Output : Refutation 87.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 13 unt; 11 nHn; 27 RR)
% Number of literals : 62 ( 3 equ; 19 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(somewhere_above_lower_bound,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
cnf(predecessor_less,axiom,
( ~ less_than(successor(X8),successor(X9))
| less_than(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',predecessor_less) ).
cnf(successor_greater,axiom,
less_than(X3,successor(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_greater) ).
cnf(transitivity_of_less,axiom,
( ~ less_than(X12,X13)
| ~ less_than(X13,X11)
| less_than(X12,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less) ).
cnf(c11,plain,
( ~ less_than(X15,X16)
| less_than(X15,successor(X16)) ),
inference(resolution,[status(thm)],[transitivity_of_less,successor_greater]) ).
cnf(somewhere_below_upper_bound,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
cnf(maximal_above_lower_bound,axiom,
~ less_than(index_of_maximal,lower_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_above_lower_bound) ).
cnf(in_bounds,axiom,
( less_than(X4,lower_bound)
| less_than(upper_bound,X4)
| in_array_bounds(array,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_bounds) ).
cnf(c4,plain,
( less_than(upper_bound,an_index)
| in_array_bounds(array,an_index) ),
inference(resolution,[status(thm)],[in_bounds,somewhere_above_lower_bound]) ).
cnf(c33,plain,
in_array_bounds(array,an_index),
inference(resolution,[status(thm)],[c4,somewhere_below_upper_bound]) ).
cnf(maximal_before_somewhere,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_before_somewhere) ).
cnf(c12,plain,
( ~ less_than(X19,index_of_maximal)
| less_than(X19,an_index) ),
inference(resolution,[status(thm)],[transitivity_of_less,maximal_before_somewhere]) ).
cnf(c6,plain,
( less_than(upper_bound,index_of_maximal)
| in_array_bounds(array,index_of_maximal) ),
inference(resolution,[status(thm)],[maximal_above_lower_bound,in_bounds]) ).
cnf(c38,plain,
( in_array_bounds(array,index_of_maximal)
| less_than(upper_bound,an_index) ),
inference(resolution,[status(thm)],[c6,c12]) ).
cnf(c72,plain,
in_array_bounds(array,index_of_maximal),
inference(resolution,[status(thm)],[c38,somewhere_below_upper_bound]) ).
cnf(c16,plain,
less_than(index_of_maximal,successor(an_index)),
inference(resolution,[status(thm)],[c11,maximal_before_somewhere]) ).
cnf(prove_this,negated_conjecture,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(this_is_maximal,axiom,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',this_is_maximal) ).
cnf(c81,plain,
maximal_value = array_value_at(array,index_of_maximal),
inference(resolution,[status(thm)],[c72,this_is_maximal]) ).
cnf(c85,plain,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal) ),
inference(resolution,[status(thm)],[c81,prove_this]) ).
cnf(c446,plain,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ in_array_bounds(array,index_of_maximal) ),
inference(resolution,[status(thm)],[c85,c16]) ).
cnf(c6893,plain,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound) ),
inference(resolution,[status(thm)],[c446,c72]) ).
cnf(c69955,plain,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound) ),
inference(resolution,[status(thm)],[c6893,c33]) ).
cnf(c70192,plain,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index)) ),
inference(resolution,[status(thm)],[c69955,maximal_above_lower_bound]) ).
cnf(c70270,plain,
( less_than(successor(an_index),lower_bound)
| less_than(upper_bound,an_index) ),
inference(resolution,[status(thm)],[c70192,predecessor_less]) ).
cnf(c70371,plain,
less_than(successor(an_index),lower_bound),
inference(resolution,[status(thm)],[c70270,somewhere_below_upper_bound]) ).
cnf(c70455,plain,
less_than(successor(an_index),successor(lower_bound)),
inference(resolution,[status(thm)],[c70371,c11]) ).
cnf(c70472,plain,
less_than(an_index,lower_bound),
inference(resolution,[status(thm)],[c70455,predecessor_less]) ).
cnf(c70573,plain,
$false,
inference(resolution,[status(thm)],[c70472,somewhere_above_lower_bound]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV019-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 9 05:23:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 87.98/88.19 % Version: 1.5
% 87.98/88.19 % SZS status Unsatisfiable
% 87.98/88.19 % SZS output start CNFRefutation
% See solution above
% 87.98/88.19
% 87.98/88.19 % Initial clauses : 17
% 87.98/88.19 % Processed clauses : 1617
% 87.98/88.19 % Factors computed : 39
% 87.98/88.19 % Resolvents computed: 70532
% 87.98/88.19 % Tautologies deleted: 3
% 87.98/88.19 % Forward subsumed : 2623
% 87.98/88.19 % Backward subsumed : 30
% 87.98/88.19 % -------- CPU Time ---------
% 87.98/88.19 % User time : 87.583 s
% 87.98/88.19 % System time : 0.220 s
% 87.98/88.19 % Total time : 87.803 s
%------------------------------------------------------------------------------