↑ Up

CSE---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : ALG201+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n003.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 : Mon Jun 24 03:40:59 EDT 2024

% Result   : Theorem 0.48s 0.70s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ALG201+1 : TPTP v8.2.0. Released v2.7.0.
% 0.03/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n003.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   : Wed Jun 19 15:57:09 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.18/0.55  start to proof:theBenchmark
% 0.48/0.70  %-------------------------------------------
% 0.48/0.70  % File        :CSE---1.7
% 0.48/0.70  % Problem     :theBenchmark
% 0.48/0.70  % Transform   :cnf
% 0.48/0.70  % Format      :tptp:raw
% 0.48/0.70  % Command     :java -jar mcs_scs.jar %d %s
% 0.48/0.70  
% 0.48/0.70  % Result      :Theorem 0.120000s
% 0.48/0.70  % Output      :CNFRefutation 0.120000s
% 0.48/0.70  %-------------------------------------------
% 0.48/0.70  %--------------------------------------------------------------------------
% 0.48/0.70  % File     : ALG201+1 : TPTP v8.2.0. Released v2.7.0.
% 0.48/0.70  % Domain   : General Algebra
% 0.48/0.70  % Problem  : Quasigroups 7 QG5: CPROPS-SORTED-DISCRIMINANT-PROBLEM-1
% 0.48/0.70  % Version  : Especial.
% 0.48/0.70  % English  :
% 0.48/0.70  
% 0.48/0.70  % Refs     : [Mei03] Meier (2003), Email to G.Sutcliffe
% 0.48/0.70  %          : [CM+04] Colton et al. (2004), Automatic Generation of Classifi
% 0.48/0.70  % Source   : [Mei03]
% 0.48/0.70  % Names    :
% 0.48/0.70  
% 0.48/0.70  % Status   : Theorem
% 0.48/0.70  % Rating   : 0.08 v8.1.0, 0.11 v7.5.0, 0.12 v7.4.0, 0.03 v7.1.0, 0.00 v6.4.0, 0.04 v6.3.0, 0.00 v6.2.0, 0.08 v6.1.0, 0.13 v6.0.0, 0.09 v5.5.0, 0.11 v5.4.0, 0.14 v5.3.0, 0.19 v5.2.0, 0.05 v5.0.0, 0.08 v4.1.0, 0.13 v4.0.0, 0.12 v3.7.0, 0.05 v3.4.0, 0.11 v3.3.0, 0.07 v3.2.0, 0.18 v3.1.0, 0.11 v2.7.0
% 0.48/0.70  % Syntax   : Number of formulae    :    5 (   0 unt;   0 def)
% 0.48/0.70  %            Number of atoms       :   24 (   6 equ)
% 0.48/0.70  %            Maximal formula atoms :   14 (   4 avg)
% 0.48/0.70  %            Number of connectives :   23 (   4   ~;   0   |;   4   &)
% 0.48/0.70  %                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
% 0.48/0.70  %            Maximal formula depth :    9 (   6 avg)
% 0.48/0.70  %            Maximal term depth    :    3 (   1 avg)
% 0.48/0.70  %            Number of predicates  :    3 (   2 usr;   0 prp; 1-2 aty)
% 0.48/0.70  %            Number of functors    :    4 (   4 usr;   0 con; 1-2 aty)
% 0.48/0.70  %            Number of variables   :   14 (  14   !;   0   ?)
% 0.48/0.70  % SPC      : FOF_THM_RFO_SEQ
% 0.48/0.70  
% 0.48/0.70  % Comments :
% 0.48/0.70  %--------------------------------------------------------------------------
% 0.48/0.70  fof(ax1,axiom,
% 0.48/0.70      ! [U] :
% 0.48/0.70        ( sorti1(U)
% 0.48/0.70       => ! [V] :
% 0.48/0.70            ( sorti1(V)
% 0.48/0.70           => sorti1(op1(U,V)) ) ) ).
% 0.48/0.70  
% 0.48/0.70  fof(ax2,axiom,
% 0.48/0.70      ! [U] :
% 0.48/0.70        ( sorti2(U)
% 0.48/0.70       => ! [V] :
% 0.48/0.70            ( sorti2(V)
% 0.48/0.70           => sorti2(op2(U,V)) ) ) ).
% 0.48/0.70  
% 0.48/0.70  fof(ax3,axiom,
% 0.48/0.70      ! [U] :
% 0.48/0.70        ( sorti1(U)
% 0.48/0.70       => op1(U,U) != U ) ).
% 0.48/0.70  
% 0.48/0.70  fof(ax4,axiom,
% 0.48/0.70      ~ ! [U] :
% 0.48/0.70          ( sorti2(U)
% 0.48/0.70         => op2(U,U) != U ) ).
% 0.48/0.70  
% 0.48/0.70  fof(co1,conjecture,
% 0.48/0.70      ( ( ! [U] :
% 0.48/0.70            ( sorti1(U)
% 0.48/0.70           => sorti2(h(U)) )
% 0.48/0.70        & ! [V] :
% 0.48/0.70            ( sorti2(V)
% 0.48/0.70           => sorti1(j(V)) ) )
% 0.48/0.70     => ~ ( ! [W] :
% 0.48/0.70              ( sorti1(W)
% 0.48/0.70             => ! [X] :
% 0.48/0.70                  ( sorti1(X)
% 0.48/0.70                 => h(op1(W,X)) = op2(h(W),h(X)) ) )
% 0.48/0.70          & ! [Y] :
% 0.48/0.70              ( sorti2(Y)
% 0.48/0.70             => ! [Z] :
% 0.48/0.70                  ( sorti2(Z)
% 0.48/0.70                 => j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
% 0.48/0.70          & ! [X1] :
% 0.48/0.70              ( sorti2(X1)
% 0.48/0.70             => h(j(X1)) = X1 )
% 0.48/0.70          & ! [X2] :
% 0.48/0.70              ( sorti1(X2)
% 0.48/0.70             => j(h(X2)) = X2 ) ) ) ).
% 0.48/0.70  
% 0.48/0.70  %--------------------------------------------------------------------------
% 0.48/0.70  %-------------------------------------------
% 0.48/0.70  % Proof found
% 0.48/0.70  % SZS status Theorem for theBenchmark
% 0.48/0.70  % SZS output start Proof
% 0.48/0.71  %ClaNum:22(EqnAxiom:11)
% 0.48/0.71  %VarNum:34(SingletonVarNum:13)
% 0.48/0.71  %MaxLitNum:3
% 0.48/0.71  %MaxfuncDepth:2
% 0.48/0.71  %SharedTerms:4
% 0.48/0.71  %goalClause: 14 15 16 17 21 22
% 0.48/0.71  [12]P1(a1)
% 0.48/0.71  [13]E(f2(a1,a1),a1)
% 0.48/0.71  [14]~P1(x141)+P2(f3(x141))
% 0.48/0.71  [15]~P2(x151)+P1(f4(x151))
% 0.48/0.71  [18]~P2(x181)+~E(f5(x181,x181),x181)
% 0.48/0.71  [16]~P1(x161)+E(f4(f3(x161)),x161)
% 0.48/0.71  [17]~P2(x171)+E(f3(f4(x171)),x171)
% 0.48/0.71  [19]~P2(x192)+~P2(x191)+P2(f5(x191,x192))
% 0.48/0.71  [20]~P1(x202)+~P1(x201)+P1(f2(x201,x202))
% 0.48/0.71  [21]~P2(x212)+~P2(x211)+E(f2(f4(x211),f4(x212)),f4(f5(x211,x212)))
% 0.48/0.71  [22]~P1(x222)+~P1(x221)+E(f5(f3(x221),f3(x222)),f3(f2(x221,x222)))
% 0.48/0.71  %EqnAxiom
% 0.48/0.71  [1]E(x11,x11)
% 0.48/0.71  [2]E(x22,x21)+~E(x21,x22)
% 0.48/0.71  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.48/0.71  [4]~E(x41,x42)+E(f2(x41,x43),f2(x42,x43))
% 0.48/0.71  [5]~E(x51,x52)+E(f2(x53,x51),f2(x53,x52))
% 0.48/0.71  [6]~E(x61,x62)+E(f3(x61),f3(x62))
% 0.48/0.71  [7]~E(x71,x72)+E(f4(x71),f4(x72))
% 0.48/0.71  [8]~E(x81,x82)+E(f5(x81,x83),f5(x82,x83))
% 0.48/0.71  [9]~E(x91,x92)+E(f5(x93,x91),f5(x93,x92))
% 0.48/0.71  [10]~P1(x101)+P1(x102)+~E(x101,x102)
% 0.48/0.71  [11]~P2(x111)+P2(x112)+~E(x111,x112)
% 0.48/0.71  
% 0.48/0.71  %-------------------------------------------
% 0.48/0.71  cnf(23,plain,
% 0.48/0.71     (E(a1,f2(a1,a1))),
% 0.48/0.71     inference(scs_inference,[],[13,2])).
% 0.48/0.71  cnf(33,plain,
% 0.48/0.71     (E(f3(f2(a1,a1)),f3(a1))),
% 0.48/0.71     inference(scs_inference,[],[23,6,2])).
% 0.48/0.71  cnf(82,plain,
% 0.48/0.71     (~E(f5(f3(a1),f3(a1)),f3(a1))),
% 0.48/0.71     inference(scs_inference,[],[12,14,18])).
% 0.48/0.71  cnf(84,plain,
% 0.48/0.71     ($false),
% 0.48/0.71     inference(scs_inference,[],[12,33,82,3,22]),
% 0.48/0.71     ['proof']).
% 0.48/0.71  % SZS output end Proof
% 0.48/0.71  % Total time :0.120000s
%------------------------------------------------------------------------------