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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : COL058-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 : n008.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:30 EDT 2023

% Result   : Unsatisfiable 0.19s 0.64s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : COL058-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n008.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   : Sun Aug 27 05:00:47 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.57  start to proof:theBenchmark
% 0.19/0.63  %-------------------------------------------
% 0.19/0.63  % File        :CSE---1.6
% 0.19/0.63  % Problem     :theBenchmark
% 0.19/0.63  % Transform   :cnf
% 0.19/0.63  % Format      :tptp:raw
% 0.19/0.63  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.63  
% 0.19/0.63  % Result      :Theorem 0.020000s
% 0.19/0.63  % Output      :CNFRefutation 0.020000s
% 0.19/0.63  %-------------------------------------------
% 0.19/0.64  %--------------------------------------------------------------------------
% 0.19/0.64  % File     : COL058-1 : TPTP v8.1.2. Released v1.0.0.
% 0.19/0.64  % Domain   : Combinatory Logic
% 0.19/0.64  % Problem  : If there's a lark, then there's an egocentric bird.
% 0.19/0.64  % Version  : Especial.
% 0.19/0.64  % English  : Suppose we are given a forest that conrtains a lark, and
% 0.19/0.64  %            we are not given any other information. Prove that at least
% 0.19/0.64  %            one bird in the forest must be egocentric.
% 0.19/0.64  
% 0.19/0.64  % Refs     : [Smu85] Smullyan (1978), To Mock a Mocking Bird and Other Logi
% 0.19/0.64  %          : [GO86]  Glickfield & Overbeek (1986), A Foray into Combinatory
% 0.19/0.64  % Source   : [GO86]
% 0.19/0.64  % Names    : - [GO86]
% 0.19/0.64  
% 0.19/0.64  % Status   : Unsatisfiable
% 0.19/0.64  % Rating   : 0.08 v8.1.0, 0.15 v7.5.0, 0.12 v7.4.0, 0.17 v7.3.0, 0.11 v7.1.0, 0.06 v7.0.0, 0.00 v6.0.0, 0.05 v5.5.0, 0.00 v2.0.0
% 0.19/0.64  % Syntax   : Number of clauses     :    2 (   2 unt;   0 nHn;   1 RR)
% 0.19/0.64  %            Number of literals    :    2 (   2 equ;   1 neg)
% 0.19/0.64  %            Maximal clause size   :    1 (   1 avg)
% 0.19/0.64  %            Maximal term depth    :    3 (   2 avg)
% 0.19/0.64  %            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
% 0.19/0.64  %            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
% 0.19/0.64  %            Number of variables   :    3 (   0 sgn)
% 0.19/0.64  % SPC      : CNF_UNS_RFO_PEQ_UEQ
% 0.19/0.64  
% 0.19/0.64  % Comments :
% 0.19/0.64  %--------------------------------------------------------------------------
% 0.19/0.64  %---- There exists a lark
% 0.19/0.64  cnf(lark_exists,axiom,
% 0.19/0.64      response(response(lark,X1),X2) = response(X1,response(X2,X2)) ).
% 0.19/0.64  
% 0.19/0.64  %---- Hypothesis: There exists a bird x that is fond of itself.
% 0.19/0.64  cnf(prove_the_bird_exists,negated_conjecture,
% 0.19/0.64      response(X,X) != X ).
% 0.19/0.64  
% 0.19/0.64  %--------------------------------------------------------------------------
% 0.19/0.64  %-------------------------------------------
% 0.19/0.64  % Proof found
% 0.19/0.64  % SZS status Theorem for theBenchmark
% 0.19/0.64  % SZS output start Proof
% 0.19/0.64  %ClaNum:7(EqnAxiom:5)
% 0.19/0.64  %VarNum:8(SingletonVarNum:3)
% 0.19/0.64  %MaxLitNum:1
% 0.19/0.64  %MaxfuncDepth:2
% 0.19/0.64  %SharedTerms:1
% 0.19/0.64  %goalClause: 7
% 0.19/0.64  %singleGoalClaCount:1
% 0.19/0.64  [7]~E(f2(x71,x71),x71)
% 0.19/0.64  [6]E(f2(f2(a1,x61),x62),f2(x61,f2(x62,x62)))
% 0.19/0.64  %EqnAxiom
% 0.19/0.64  [1]E(x11,x11)
% 0.19/0.64  [2]E(x22,x21)+~E(x21,x22)
% 0.19/0.64  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.19/0.64  [4]~E(x41,x42)+E(f2(x41,x43),f2(x42,x43))
% 0.19/0.64  [5]~E(x51,x52)+E(f2(x53,x51),f2(x53,x52))
% 0.19/0.64  
% 0.19/0.64  %-------------------------------------------
% 0.19/0.64  cnf(8,plain,
% 0.19/0.64     (E(f2(x81,f2(x82,x82)),f2(f2(a1,x81),x82))),
% 0.19/0.64     inference(scs_inference,[],[6,2])).
% 0.19/0.64  cnf(13,plain,
% 0.19/0.64     (~E(x131,f2(x131,x131))),
% 0.19/0.64     inference(scs_inference,[],[7,2])).
% 0.19/0.65  cnf(20,plain,
% 0.19/0.65     (~E(f2(f2(a1,f2(x201,x201)),x201),f2(x201,x201))),
% 0.19/0.65     inference(scs_inference,[],[13,6,3,2])).
% 0.19/0.65  cnf(29,plain,
% 0.19/0.65     ($false),
% 0.19/0.65     inference(scs_inference,[],[20,8,6,4,3,2]),
% 0.19/0.65     ['proof']).
% 0.19/0.65  % SZS output end Proof
% 0.19/0.65  % Total time :0.020000s
%------------------------------------------------------------------------------