TSTP Solution File: SWV019-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV019-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n005.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 Aug 31 21:31:36 EDT 2023
% Result : Unsatisfiable 0.21s 0.66s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV019-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 04:19:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.58 start to proof:theBenchmark
% 0.21/0.65 %-------------------------------------------
% 0.21/0.65 % File :CSE---1.6
% 0.21/0.65 % Problem :theBenchmark
% 0.21/0.65 % Transform :cnf
% 0.21/0.65 % Format :tptp:raw
% 0.21/0.65 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.65
% 0.21/0.65 % Result :Theorem 0.030000s
% 0.21/0.65 % Output :CNFRefutation 0.030000s
% 0.21/0.65 %-------------------------------------------
% 0.21/0.66 %--------------------------------------------------------------------------
% 0.21/0.66 % File : SWV019-1 : TPTP v8.1.2. Released v2.4.0.
% 0.21/0.66 % Domain : Software Verification
% 0.21/0.66 % Problem : Maximal array element
% 0.21/0.66 % Version : [Ver93] axioms : Incomplete.
% 0.21/0.66 % English :
% 0.21/0.66
% 0.21/0.66 % Refs : [Ver93] Veroff (1993), Email to G. Sutcliffe
% 0.21/0.66 % Source : [Ver93]
% 0.21/0.66 % Names :
% 0.21/0.66
% 0.21/0.66 % Status : Unsatisfiable
% 0.21/0.66 % Rating : 0.05 v8.1.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v3.3.0, 0.07 v3.2.0, 0.08 v3.1.0, 0.09 v2.7.0, 0.08 v2.6.0, 0.00 v2.4.0
% 0.21/0.66 % Syntax : Number of clauses : 10 ( 5 unt; 2 nHn; 8 RR)
% 0.21/0.66 % Number of literals : 22 ( 2 equ; 11 neg)
% 0.21/0.66 % Maximal clause size : 7 ( 2 avg)
% 0.21/0.66 % Maximal term depth : 2 ( 1 avg)
% 0.21/0.66 % Number of predicates : 3 ( 2 usr; 0 prp; 2-2 aty)
% 0.21/0.66 % Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% 0.21/0.66 % Number of variables : 7 ( 0 sgn)
% 0.21/0.66 % SPC : CNF_UNS_RFO_SEQ_NHN
% 0.21/0.66
% 0.21/0.66 % Comments : [Ver93] says "Only the clauses needed for the proof are included.
% 0.21/0.66 % What makes the problem interesting/challenging from a theorem
% 0.21/0.66 % proving perspective is the addition of standard sets of axioms
% 0.21/0.66 % (that don't participate in the proof, but sure get in the way
% 0.21/0.66 % of finding the proof).
% 0.21/0.66 %--------------------------------------------------------------------------
% 0.21/0.66 cnf(in_bounds,axiom,
% 0.21/0.66 ( less_than(X1,lower_bound)
% 0.21/0.66 | less_than(upper_bound,X1)
% 0.21/0.66 | in_array_bounds(array,X1) ) ).
% 0.21/0.66
% 0.21/0.66 cnf(predecessor_less,axiom,
% 0.21/0.66 ( ~ less_than(successor(X),successor(Y))
% 0.21/0.66 | less_than(X,Y) ) ).
% 0.21/0.66
% 0.21/0.66 cnf(transitivity_of_less,axiom,
% 0.21/0.66 ( ~ less_than(X,Y)
% 0.21/0.66 | ~ less_than(Y,Z)
% 0.21/0.66 | less_than(X,Z) ) ).
% 0.21/0.66
% 0.21/0.66 cnf(successor_greater,axiom,
% 0.21/0.66 less_than(X,successor(X)) ).
% 0.21/0.66
% 0.21/0.66 cnf(this_is_maximal,axiom,
% 0.21/0.66 ( ~ in_array_bounds(array,index_of_maximal)
% 0.21/0.66 | maximal_value = array_value_at(array,index_of_maximal) ) ).
% 0.21/0.66
% 0.21/0.66 cnf(maximal_before_somewhere,axiom,
% 0.21/0.66 less_than(index_of_maximal,an_index) ).
% 0.21/0.66
% 0.21/0.66 cnf(somewhere_above_lower_bound,axiom,
% 0.21/0.66 ~ less_than(an_index,lower_bound) ).
% 0.21/0.66
% 0.21/0.66 cnf(somewhere_below_upper_bound,axiom,
% 0.21/0.66 ~ less_than(upper_bound,an_index) ).
% 0.21/0.66
% 0.21/0.66 cnf(maximal_above_lower_bound,axiom,
% 0.21/0.66 ~ less_than(index_of_maximal,lower_bound) ).
% 0.21/0.66
% 0.21/0.66 cnf(prove_this,negated_conjecture,
% 0.21/0.66 ( ~ in_array_bounds(array,an_index)
% 0.21/0.66 | less_than(successor(an_index),lower_bound)
% 0.21/0.66 | less_than(successor(upper_bound),successor(an_index))
% 0.21/0.66 | less_than(index_of_maximal,lower_bound)
% 0.21/0.66 | ~ less_than(index_of_maximal,successor(an_index))
% 0.21/0.66 | ~ in_array_bounds(array,index_of_maximal)
% 0.21/0.66 | maximal_value != array_value_at(array,index_of_maximal) ) ).
% 0.21/0.66
% 0.21/0.66 %--------------------------------------------------------------------------
% 0.21/0.66 %-------------------------------------------
% 0.21/0.66 % Proof found
% 0.21/0.66 % SZS status Theorem for theBenchmark
% 0.21/0.66 % SZS output start Proof
% 0.21/0.66 %ClaNum:20(EqnAxiom:10)
% 0.21/0.66 %VarNum:15(SingletonVarNum:7)
% 0.21/0.66 %MaxLitNum:7
% 0.21/0.66 %MaxfuncDepth:1
% 0.21/0.66 %SharedTerms:21
% 0.21/0.66 %goalClause: 20
% 0.21/0.66 [11]P1(a1,a2)
% 0.21/0.66 [13]~P1(a8,a2)
% 0.21/0.66 [14]~P1(a1,a6)
% 0.21/0.66 [15]~P1(a2,a6)
% 0.21/0.66 [12]P1(x121,f5(x121))
% 0.21/0.66 [16]~P2(a3,a1)+E(f4(a3,a1),a7)
% 0.21/0.66 [18]P1(x181,x182)+~P1(f5(x181),f5(x182))
% 0.21/0.66 [17]P1(a8,x171)+P2(a3,x171)+P1(x171,a6)
% 0.21/0.66 [19]~P1(x191,x193)+P1(x191,x192)+~P1(x193,x192)
% 0.21/0.66 [20]~P2(a3,a1)+P1(a1,a6)+P1(f5(a8),f5(a2))+~P2(a3,a2)+~E(f4(a3,a1),a7)+P1(f5(a2),a6)+~P1(a1,f5(a2))
% 0.21/0.66 %EqnAxiom
% 0.21/0.66 [1]E(x11,x11)
% 0.21/0.66 [2]E(x22,x21)+~E(x21,x22)
% 0.21/0.66 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.21/0.66 [4]~E(x41,x42)+E(f5(x41),f5(x42))
% 0.21/0.66 [5]~E(x51,x52)+E(f4(x51,x53),f4(x52,x53))
% 0.21/0.66 [6]~E(x61,x62)+E(f4(x63,x61),f4(x63,x62))
% 0.21/0.66 [7]P1(x72,x73)+~E(x71,x72)+~P1(x71,x73)
% 0.21/0.66 [8]P1(x83,x82)+~E(x81,x82)+~P1(x83,x81)
% 0.21/0.66 [9]P2(x92,x93)+~E(x91,x92)+~P2(x91,x93)
% 0.21/0.66 [10]P2(x103,x102)+~E(x101,x102)+~P2(x103,x101)
% 0.21/0.66
% 0.21/0.66 %-------------------------------------------
% 0.21/0.67 cnf(26,plain,
% 0.21/0.67 (~P1(f5(a8),f5(a2))),
% 0.21/0.67 inference(scs_inference,[],[11,13,14,8,7,19,2,18])).
% 0.21/0.67 cnf(29,plain,
% 0.21/0.67 (P2(a3,a1)),
% 0.21/0.67 inference(scs_inference,[],[11,13,14,8,7,19,2,18,3,17])).
% 0.21/0.67 cnf(31,plain,
% 0.21/0.67 (E(f4(a3,a1),a7)),
% 0.21/0.67 inference(scs_inference,[],[29,16])).
% 0.21/0.67 cnf(32,plain,
% 0.21/0.67 (~P2(a3,a2)+~E(f4(a3,a1),a7)+~P1(a1,f5(a2))+P1(f5(a2),a6)),
% 0.21/0.67 inference(scs_inference,[],[14,26,29,20])).
% 0.21/0.67 cnf(36,plain,
% 0.21/0.67 (P1(x361,f5(x361))),
% 0.21/0.67 inference(rename_variables,[],[12])).
% 0.21/0.67 cnf(38,plain,
% 0.21/0.67 (P1(x381,f5(x381))),
% 0.21/0.67 inference(rename_variables,[],[12])).
% 0.21/0.67 cnf(42,plain,
% 0.21/0.67 (~E(f4(a3,a1),a7)+~P1(a1,f5(a2))),
% 0.21/0.67 inference(scs_inference,[],[15,12,36,38,13,26,17,8,19,7,32])).
% 0.21/0.67 cnf(45,plain,
% 0.21/0.67 (P1(x451,f5(x451))),
% 0.21/0.67 inference(rename_variables,[],[12])).
% 0.21/0.67 cnf(49,plain,
% 0.21/0.67 (~P1(a1,f5(a2))),
% 0.21/0.67 inference(scs_inference,[],[12,45,14,31,2,19,7,42])).
% 0.21/0.67 cnf(123,plain,
% 0.21/0.67 ($false),
% 0.21/0.67 inference(scs_inference,[],[49,11,12,19]),
% 0.21/0.67 ['proof']).
% 0.21/0.67 % SZS output end Proof
% 0.21/0.67 % Total time :0.030000s
%------------------------------------------------------------------------------