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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : COL016-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/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 : Wed Aug 30 18:21:20 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : COL016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33  % Computer : n017.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   : Sun Aug 27 04:35:41 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.20/0.55  start to proof:theBenchmark
% 0.20/0.59  %-------------------------------------------
% 0.20/0.59  % File        :CSE---1.6
% 0.20/0.59  % Problem     :theBenchmark
% 0.20/0.59  % Transform   :cnf
% 0.20/0.59  % Format      :tptp:raw
% 0.20/0.59  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.59  
% 0.20/0.59  % Result      :Theorem 0.000000s
% 0.20/0.59  % Output      :CNFRefutation 0.000000s
% 0.20/0.59  %-------------------------------------------
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  % File     : COL016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.60  % Domain   : Combinatory Logic
% 0.20/0.60  % Problem  : Weak fixed point for B, M and L
% 0.20/0.60  % Version  : [WM88] (equality) axioms.
% 0.20/0.60  % English  : The weak fixed point property holds for the set P consisting
% 0.20/0.60  %            of the combinators B, M and L, where ((Bx)y)z = x(yz), (Lx)y
% 0.20/0.60  %            = x(yy), Mx = xx.
% 0.20/0.60  
% 0.20/0.60  % Refs     : [Smu85] Smullyan (1978), To Mock a Mocking Bird and Other Logi
% 0.20/0.60  %          : [MW87]  McCune & Wos (1987), A Case Study in Automated Theorem
% 0.20/0.60  %          : [WM88]  Wos & McCune (1988), Challenge Problems Focusing on Eq
% 0.20/0.60  %          : [MW88]  McCune & Wos (1988), Some Fixed Point Problems in Comb
% 0.20/0.60  % Source   : [MW88]
% 0.20/0.60  % Names    : - [MW88]
% 0.20/0.60  
% 0.20/0.60  % Status   : Unsatisfiable
% 0.20/0.60  % Rating   : 0.08 v8.1.0, 0.10 v7.5.0, 0.08 v7.4.0, 0.17 v7.3.0, 0.11 v7.1.0, 0.06 v7.0.0, 0.00 v6.4.0, 0.05 v6.3.0, 0.00 v6.1.0, 0.06 v6.0.0, 0.10 v5.5.0, 0.05 v5.4.0, 0.07 v5.3.0, 0.08 v5.2.0, 0.07 v5.1.0, 0.00 v3.1.0, 0.11 v2.7.0, 0.00 v2.0.0
% 0.20/0.60  % Syntax   : Number of clauses     :    4 (   4 unt;   0 nHn;   1 RR)
% 0.20/0.60  %            Number of literals    :    4 (   4 equ;   1 neg)
% 0.20/0.60  %            Maximal clause size   :    1 (   1 avg)
% 0.20/0.60  %            Maximal term depth    :    4 (   2 avg)
% 0.20/0.60  %            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
% 0.20/0.60  %            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
% 0.20/0.60  %            Number of variables   :    7 (   0 sgn)
% 0.20/0.60  % SPC      : CNF_UNS_RFO_PEQ_UEQ
% 0.20/0.60  
% 0.20/0.60  % Comments :
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  cnf(b_definition,axiom,
% 0.20/0.60      apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ).
% 0.20/0.60  
% 0.20/0.60  cnf(l_definition,axiom,
% 0.20/0.60      apply(apply(l,X),Y) = apply(X,apply(Y,Y)) ).
% 0.20/0.60  
% 0.20/0.60  cnf(m_definition,axiom,
% 0.20/0.60      apply(m,X) = apply(X,X) ).
% 0.20/0.60  
% 0.20/0.60  cnf(prove_fixed_point,negated_conjecture,
% 0.20/0.60      Y != apply(combinator,Y) ).
% 0.20/0.60  
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark
% 0.20/0.60  % SZS output start Proof
% 0.20/0.60  %ClaNum:9(EqnAxiom:5)
% 0.20/0.60  %VarNum:16(SingletonVarNum:7)
% 0.20/0.60  %MaxLitNum:1
% 0.20/0.60  %MaxfuncDepth:3
% 0.20/0.60  %SharedTerms:4
% 0.20/0.60  %goalClause: 9
% 0.20/0.60  %singleGoalClaCount:1
% 0.20/0.60  [6]E(f2(a1,x61),f2(x61,x61))
% 0.20/0.60  [9]~E(f2(a5,x91),x91)
% 0.20/0.60  [7]E(f2(f2(a3,x71),x72),f2(x71,f2(x72,x72)))
% 0.20/0.60  [8]E(f2(f2(f2(a4,x81),x82),x83),f2(x81,f2(x82,x83)))
% 0.20/0.60  %EqnAxiom
% 0.20/0.60  [1]E(x11,x11)
% 0.20/0.60  [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.60  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.60  [4]~E(x41,x42)+E(f2(x41,x43),f2(x42,x43))
% 0.20/0.60  [5]~E(x51,x52)+E(f2(x53,x51),f2(x53,x52))
% 0.20/0.60  
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  cnf(15,plain,
% 0.20/0.60     ($false),
% 0.20/0.60     inference(scs_inference,[],[9,7,2]),
% 0.20/0.60     ['proof']).
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time :0.000000s
%------------------------------------------------------------------------------