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

View Problem - Process Solution

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

% Computer : n017.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:45:25 EDT 2023

% Result   : Theorem 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    : SYN361+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sat Aug 26 20:10:26 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.20/0.56  start to proof:theBenchmark
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  % File        :CSE---1.6
% 0.20/0.61  % Problem     :theBenchmark
% 0.20/0.61  % Transform   :cnf
% 0.20/0.61  % Format      :tptp:raw
% 0.20/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.61  
% 0.20/0.61  % Result      :Theorem 0.000000s
% 0.20/0.61  % Output      :CNFRefutation 0.000000s
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  % File     : SYN361+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.61  % Domain   : Syntactic
% 0.20/0.61  % Problem  : Peter Andrews Problem X2112
% 0.20/0.61  % Version  : Especial.
% 0.20/0.61  % English  :
% 0.20/0.61  
% 0.20/0.61  % Refs     : [And86] Andrews (1986), An Introduction to Mathematical Logic
% 0.20/0.61  %          : [And94] Andrews (1994), Email to G. Sutcliffe
% 0.20/0.61  % Source   : [And94]
% 0.20/0.61  % Names    : X2112 [And86]
% 0.20/0.61  
% 0.20/0.61  % Status   : Theorem
% 0.20/0.61  % Rating   : 0.00 v6.4.0, 0.07 v6.3.0, 0.08 v6.2.0, 0.09 v6.1.0, 0.08 v6.0.0, 0.25 v5.5.0, 0.04 v5.3.0, 0.13 v5.2.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.20/0.61  % Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
% 0.20/0.61  %            Number of atoms       :    6 (   0 equ)
% 0.20/0.61  %            Maximal formula atoms :    6 (   6 avg)
% 0.20/0.61  %            Number of connectives :    7 (   2   ~;   0   |;   2   &)
% 0.20/0.61  %                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
% 0.20/0.61  %            Maximal formula depth :    8 (   8 avg)
% 0.20/0.61  %            Maximal term depth    :    1 (   1 avg)
% 0.20/0.61  %            Number of predicates  :    3 (   3 usr;   0 prp; 1-2 aty)
% 0.20/0.61  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.20/0.61  %            Number of variables   :    7 (   4   !;   3   ?)
% 0.20/0.61  % SPC      : FOF_THM_RFO_NEQ
% 0.20/0.61  
% 0.20/0.61  % Comments :
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  fof(x2112,conjecture,
% 0.20/0.61      ( ( ? [V] :
% 0.20/0.61          ! [X] : big_p(X,V)
% 0.20/0.61        & ! [X] :
% 0.20/0.61            ( big_s(X)
% 0.20/0.61           => ? [Y] : big_q(Y,X) )
% 0.20/0.61        & ! [X,Y] :
% 0.20/0.61            ( big_p(X,Y)
% 0.20/0.61           => ~ big_q(X,Y) ) )
% 0.20/0.61     => ? [U] : ~ big_s(U) ) ).
% 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:3(EqnAxiom:0)
% 0.20/0.61  %VarNum:7(SingletonVarNum:4)
% 0.20/0.61  %MaxLitNum:2
% 0.20/0.61  %MaxfuncDepth:1
% 0.20/0.61  %SharedTerms:1
% 0.20/0.61  %goalClause: 1 2 3
% 0.20/0.61  %singleGoalClaCount:2
% 0.20/0.61  [1]P1(x11,a1)
% 0.20/0.61  [2]P2(f2(x21),x21)
% 0.20/0.61  [3]~P2(x31,x32)+~P1(x31,x32)
% 0.20/0.61  %EqnAxiom
% 0.20/0.61  
% 0.20/0.61  %-------------------------------------------
% 0.20/0.62  cnf(4,plain,
% 0.20/0.62     ($false),
% 0.20/0.62     inference(scs_inference,[],[2,1,3]),
% 0.20/0.62     ['proof']).
% 0.20/0.62  % SZS output end Proof
% 0.20/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------