TSTP Solution File: SYN069+1 by CSE---1.6

View Problem - Process Solution

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

% 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 : Fri Sep  1 01:44:01 EDT 2023

% Result   : Theorem 0.21s 0.62s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN069+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n015.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   : Sat Aug 26 18:39:23 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.21/0.56  start to proof:theBenchmark
% 0.21/0.61  %-------------------------------------------
% 0.21/0.61  % File        :CSE---1.6
% 0.21/0.61  % Problem     :theBenchmark
% 0.21/0.61  % Transform   :cnf
% 0.21/0.61  % Format      :tptp:raw
% 0.21/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.21/0.61  
% 0.21/0.61  % Result      :Theorem 0.000000s
% 0.21/0.61  % Output      :CNFRefutation 0.000000s
% 0.21/0.61  %-------------------------------------------
% 0.21/0.61  %--------------------------------------------------------------------------
% 0.21/0.61  % File     : SYN069+1 : TPTP v8.1.2. Released v2.0.0.
% 0.21/0.61  % Domain   : Syntactic
% 0.21/0.61  % Problem  : Pelletier Problem 45
% 0.21/0.61  % Version  : Especial.
% 0.21/0.61  % English  :
% 0.21/0.61  
% 0.21/0.61  % Refs     : [KM64]  Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.21/0.61  %          : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.21/0.61  %          : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.21/0.61  % Source   : [Hah94]
% 0.21/0.61  % Names    : Pelletier 45 [Pel86]
% 0.21/0.61  
% 0.21/0.61  % Status   : ContradictoryAxioms
% 0.21/0.61  % Rating   : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.0.1, 0.05 v3.7.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.21/0.61  % Syntax   : Number of formulae    :    4 (   0 unt;   0 def)
% 0.21/0.62  %            Number of atoms       :   18 (   0 equ)
% 0.21/0.62  %            Maximal formula atoms :    7 (   4 avg)
% 0.21/0.62  %            Number of connectives :   16 (   2   ~;   0   |;  10   &)
% 0.21/0.62  %                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
% 0.21/0.62  %            Maximal formula depth :    7 (   6 avg)
% 0.21/0.62  %            Maximal term depth    :    1 (   1 avg)
% 0.21/0.62  %            Number of predicates  :    6 (   6 usr;   0 prp; 1-2 aty)
% 0.21/0.62  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.21/0.62  %            Number of variables   :    9 (   5   !;   4   ?)
% 0.21/0.62  % SPC      : FOF_CAX_RFO_NEQ
% 0.21/0.62  
% 0.21/0.62  % Comments :
% 0.21/0.62  %--------------------------------------------------------------------------
% 0.21/0.62  fof(pel45_1,axiom,
% 0.21/0.62      ! [X] :
% 0.21/0.62        ( ( big_f(X)
% 0.21/0.62          & ! [Y] :
% 0.21/0.62              ( ( big_g(Y)
% 0.21/0.62                & big_h(X,Y) )
% 0.21/0.62             => big_j(X,Y) ) )
% 0.21/0.62       => ! [Y1] :
% 0.21/0.62            ( big_g(Y1)
% 0.21/0.62            & big_h(X,Y1)
% 0.21/0.62            & big_k(Y1) ) ) ).
% 0.21/0.62  
% 0.21/0.62  fof(pel45_2,axiom,
% 0.21/0.62      ~ ? [Y] :
% 0.21/0.62          ( big_l(Y)
% 0.21/0.62          & big_k(Y) ) ).
% 0.21/0.62  
% 0.21/0.62  fof(pel45_3,axiom,
% 0.21/0.62      ? [X] :
% 0.21/0.62        ( big_f(X)
% 0.21/0.62        & ! [Y] :
% 0.21/0.62            ( big_h(X,Y)
% 0.21/0.62           => big_l(Y) )
% 0.21/0.62        & ! [Y1] :
% 0.21/0.62            ( ( big_g(Y1)
% 0.21/0.62              & big_h(X,Y1) )
% 0.21/0.62           => big_j(X,Y1) ) ) ).
% 0.21/0.62  
% 0.21/0.62  fof(pel45,conjecture,
% 0.21/0.62      ? [X] :
% 0.21/0.62        ( big_f(X)
% 0.21/0.62        & ~ ? [Y] :
% 0.21/0.62              ( big_g(Y)
% 0.21/0.62              & big_h(X,Y) ) ) ).
% 0.21/0.62  
% 0.21/0.62  %--------------------------------------------------------------------------
% 0.21/0.62  %-------------------------------------------
% 0.21/0.62  % Proof found
% 0.21/0.62  % SZS status Theorem for theBenchmark
% 0.21/0.62  % SZS output start Proof
% 0.21/0.62  %ClaNum:15(EqnAxiom:0)
% 0.21/0.62  %VarNum:33(SingletonVarNum:15)
% 0.21/0.62  %MaxLitNum:3
% 0.21/0.62  %MaxfuncDepth:1
% 0.21/0.62  %SharedTerms:2
% 0.21/0.62  %goalClause: 3 7
% 0.21/0.62  [1]P1(a1)
% 0.21/0.62  [2]~P6(x21)+~P2(x21)
% 0.21/0.62  [6]P6(x61)+~P4(a1,x61)
% 0.21/0.62  [3]~P1(x31)+P3(f3(x31))
% 0.21/0.62  [7]~P1(x71)+P4(x71,f3(x71))
% 0.21/0.62  [11]~P3(x111)+~P4(a1,x111)+P5(a1,x111)
% 0.21/0.62  [4]~P1(x42)+P3(x41)+P3(f2(x42))
% 0.21/0.62  [12]~P1(x121)+P4(x121,x122)+P4(x121,f2(x121))
% 0.21/0.62  [13]P3(x131)+~P1(x132)+~P5(x132,f2(x132))
% 0.21/0.62  [14]P2(x141)+~P1(x142)+~P5(x142,f2(x142))
% 0.21/0.62  [15]~P1(x151)+P4(x151,x152)+~P5(x151,f2(x151))
% 0.21/0.62  %EqnAxiom
% 0.21/0.62  
% 0.21/0.62  %-------------------------------------------
% 0.21/0.62  cnf(16,plain,
% 0.21/0.62     (P4(a1,f3(a1))),
% 0.21/0.62     inference(scs_inference,[],[1,7])).
% 0.21/0.62  cnf(17,plain,
% 0.21/0.62     (P3(f3(a1))),
% 0.21/0.62     inference(scs_inference,[],[1,7,3])).
% 0.21/0.62  cnf(18,plain,
% 0.21/0.62     (P3(x181)+P3(f2(a1))),
% 0.21/0.62     inference(scs_inference,[],[1,7,3,4])).
% 0.21/0.62  cnf(20,plain,
% 0.21/0.62     (P6(f3(a1))),
% 0.21/0.62     inference(scs_inference,[],[1,7,3,4,6])).
% 0.21/0.62  cnf(24,plain,
% 0.21/0.62     (P2(x241)+~P5(a1,f2(a1))),
% 0.21/0.62     inference(scs_inference,[],[1,7,3,4,6,11,14])).
% 0.21/0.62  cnf(28,plain,
% 0.21/0.62     (P3(f2(a1))),
% 0.21/0.62     inference(factoring_inference,[],[18])).
% 0.21/0.62  cnf(31,plain,
% 0.21/0.62     (~P5(a1,f2(a1))),
% 0.21/0.62     inference(scs_inference,[],[20,2,24])).
% 0.21/0.62  cnf(35,plain,
% 0.21/0.62     (P4(a1,x351)+P4(a1,f2(a1))),
% 0.21/0.62     inference(scs_inference,[],[1,17,20,16,2,24,11,12])).
% 0.21/0.62  cnf(37,plain,
% 0.21/0.62     (P4(a1,f2(a1))),
% 0.21/0.62     inference(factoring_inference,[],[35])).
% 0.21/0.62  cnf(39,plain,
% 0.21/0.62     ($false),
% 0.21/0.62     inference(scs_inference,[],[31,37,28,11]),
% 0.21/0.62     ['proof']).
% 0.21/0.62  % SZS output end Proof
% 0.21/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------