TSTP Solution File: SWV005-1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n011.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:32 EDT 2023

% Result   : Unsatisfiable 0.20s 0.61s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 29 10:45:56 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.56  start to proof:theBenchmark
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  % File        :CSE---1.6
% 0.20/0.60  % Problem     :theBenchmark
% 0.20/0.60  % Transform   :cnf
% 0.20/0.60  % Format      :tptp:raw
% 0.20/0.60  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.60  
% 0.20/0.60  % Result      :Theorem 0.000000s
% 0.20/0.60  % Output      :CNFRefutation 0.000000s
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  % File     : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.60  % Domain   : Software Verification
% 0.20/0.60  % Problem  : E4
% 0.20/0.60  % Version  : Especial.
% 0.20/0.60  % English  :
% 0.20/0.60  
% 0.20/0.60  % Refs     : [MOW76] McCharen et al. (1976), Problems and Experiments for a
% 0.20/0.60  % Source   : [SETHEO]
% 0.20/0.60  % Names    : E4 [MOW76]
% 0.20/0.60  %          : v4.lop [SETHEO]
% 0.20/0.60  
% 0.20/0.60  % Status   : Unsatisfiable
% 0.20/0.60  % Rating   : 0.05 v8.1.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v5.5.0, 0.05 v5.3.0, 0.06 v5.0.0, 0.00 v4.0.1, 0.09 v4.0.0, 0.00 v3.3.0, 0.07 v3.2.0, 0.00 v3.1.0, 0.09 v2.7.0, 0.08 v2.6.0, 0.00 v2.1.0, 0.00 v2.0.0
% 0.20/0.60  % Syntax   : Number of clauses     :   21 (  11 unt;   2 nHn;  16 RR)
% 0.20/0.61  %            Number of literals    :   39 (   9 equ;  21 neg)
% 0.20/0.61  %            Maximal clause size   :    4 (   1 avg)
% 0.20/0.61  %            Maximal term depth    :    3 (   1 avg)
% 0.20/0.61  %            Number of predicates  :    2 (   1 usr;   0 prp; 2-2 aty)
% 0.20/0.61  %            Number of functors    :    8 (   8 usr;   5 con; 0-1 aty)
% 0.20/0.61  %            Number of variables   :   25 (   0 sgn)
% 0.20/0.61  % SPC      : CNF_UNS_RFO_SEQ_NHN
% 0.20/0.61  
% 0.20/0.61  % Comments : This problem was contributed to [MOW76] in private
% 0.20/0.61  %            correspondance from G. Ernst. The axioms are incomplete.
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  %----Include axioms for this program verification
% 0.20/0.61  include('Axioms/SWV001-0.ax').
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  cnf(clause_1,negated_conjecture,
% 0.20/0.61      ~ less_than(n,k) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause_2,negated_conjecture,
% 0.20/0.61      ~ less_than(k,l) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause_3,negated_conjecture,
% 0.20/0.61      ~ less_than(k,i) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause_4,negated_conjecture,
% 0.20/0.61      less_than(l,n) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause_5,negated_conjecture,
% 0.20/0.61      less_than(one,l) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause_6,negated_conjecture,
% 0.20/0.61      less_than(a(k),a(predecessor(l))) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause_7,negated_conjecture,
% 0.20/0.61      ( less_than(X,l)
% 0.20/0.61      | ~ less_than(X,successor(n))
% 0.20/0.61      | ~ less_than(a(X),a(k)) ) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause_8,negated_conjecture,
% 0.20/0.61      ( less_than(X,l)
% 0.20/0.61      | less_than(n,X)
% 0.20/0.61      | ~ less_than(one,l)
% 0.20/0.61      | ~ less_than(a(X),a(predecessor(l))) ) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause_9,negated_conjecture,
% 0.20/0.61      ( ~ less_than(one,X)
% 0.20/0.61      | ~ less_than(X,l)
% 0.20/0.61      | ~ less_than(a(X),a(predecessor(X))) ) ).
% 0.20/0.61  
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  % Proof found
% 0.20/0.61  % SZS status Theorem for theBenchmark
% 0.20/0.61  % SZS output start Proof
% 0.20/0.61  %ClaNum:27(EqnAxiom:8)
% 0.20/0.61  %VarNum:44(SingletonVarNum:19)
% 0.20/0.61  %MaxLitNum:4
% 0.20/0.61  %MaxfuncDepth:2
% 0.20/0.61  %SharedTerms:16
% 0.20/0.61  %goalClause: 11 12 15 16 17 18 25 26 27
% 0.20/0.61  %singleGoalClaCount:6
% 0.20/0.61  [11]P1(a2,a6)
% 0.20/0.61  [12]P1(a7,a2)
% 0.20/0.61  [16]~P1(a6,a3)
% 0.20/0.61  [17]~P1(a3,a2)
% 0.20/0.61  [18]~P1(a3,a5)
% 0.20/0.61  [15]P1(f4(a3),f4(f1(a2)))
% 0.20/0.61  [19]~P1(x191,x191)
% 0.20/0.61  [13]P1(x131,f8(x131))
% 0.20/0.61  [14]P1(f1(x141),x141)
% 0.20/0.61  [9]E(f8(f1(x91)),x91)
% 0.20/0.61  [10]E(f1(f8(x101)),x101)
% 0.20/0.61  [23]~P1(x232,x231)+~P1(x231,x232)
% 0.20/0.61  [20]E(x201,x202)+~E(f8(x201),f8(x202))
% 0.20/0.61  [21]E(x211,x212)+~E(f1(x211),f1(x212))
% 0.20/0.61  [25]P1(x251,a2)+~P1(x251,f8(a6))+~P1(f4(x251),f4(a3))
% 0.20/0.61  [27]~P1(a7,x271)+~P1(x271,a2)+~P1(f4(x271),f4(f1(x271)))
% 0.20/0.61  [22]P1(x222,x221)+P1(x221,x222)+E(x221,x222)
% 0.20/0.61  [24]~P1(x241,x243)+P1(x241,x242)+~P1(x243,x242)
% 0.20/0.61  [26]P1(a6,x261)+P1(x261,a2)+~P1(a7,a2)+~P1(f4(x261),f4(f1(a2)))
% 0.20/0.61  %EqnAxiom
% 0.20/0.61  [1]E(x11,x11)
% 0.20/0.61  [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.61  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.61  [4]~E(x41,x42)+E(f1(x41),f1(x42))
% 0.20/0.61  [5]~E(x51,x52)+E(f8(x51),f8(x52))
% 0.20/0.61  [6]~E(x61,x62)+E(f4(x61),f4(x62))
% 0.20/0.61  [7]P1(x72,x73)+~E(x71,x72)+~P1(x71,x73)
% 0.20/0.61  [8]P1(x83,x82)+~E(x81,x82)+~P1(x83,x81)
% 0.20/0.61  
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  cnf(34,plain,
% 0.20/0.61     (~P1(x341,x341)),
% 0.20/0.61     inference(rename_variables,[],[19])).
% 0.20/0.61  cnf(44,plain,
% 0.20/0.61     ($false),
% 0.20/0.61     inference(scs_inference,[],[11,19,34,12,16,17,15,13,9,10,2,23,20,8,7,3,24,25,26]),
% 0.20/0.61     ['proof']).
% 0.20/0.61  % SZS output end Proof
% 0.20/0.61  % Total time :0.000000s
%------------------------------------------------------------------------------