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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : COL055-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 : n025.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:29 EDT 2023

% Result   : Unsatisfiable 0.21s 0.63s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : COL055-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.15/0.35  % Computer : n025.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sun Aug 27 04:21:53 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.58  start to proof:theBenchmark
% 0.21/0.62  %-------------------------------------------
% 0.21/0.62  % File        :CSE---1.6
% 0.21/0.62  % Problem     :theBenchmark
% 0.21/0.62  % Transform   :cnf
% 0.21/0.62  % Format      :tptp:raw
% 0.21/0.62  % Command     :java -jar mcs_scs.jar %d %s
% 0.21/0.62  
% 0.21/0.62  % Result      :Theorem 0.000000s
% 0.21/0.62  % Output      :CNFRefutation 0.000000s
% 0.21/0.62  %-------------------------------------------
% 0.21/0.62  %--------------------------------------------------------------------------
% 0.21/0.62  % File     : COL055-1 : TPTP v8.1.2. Released v1.0.0.
% 0.21/0.62  % Domain   : Combinatory Logic
% 0.21/0.62  % Problem  : Happy Birds
% 0.21/0.62  % Version  : Especial.
% 0.21/0.62  % English  : There exists a bird which is fond of some other bird. Prove
% 0.21/0.62  %            that any bird that is fond of at least one bird must
% 0.21/0.62  %            be happy.
% 0.21/0.62  
% 0.21/0.62  % Refs     : [Smu85] Smullyan (1978), To Mock a Mocking Bird and Other Logi
% 0.21/0.62  % Source   : [ANL]
% 0.21/0.62  % Names    : bird7.ver1.in [ANL]
% 0.21/0.62  
% 0.21/0.62  % Status   : Unsatisfiable
% 0.21/0.62  % Rating   : 0.00 v5.3.0, 0.10 v5.2.0, 0.00 v2.0.0
% 0.21/0.62  % Syntax   : Number of clauses     :    2 (   1 unt;   0 nHn;   2 RR)
% 0.21/0.63  %            Number of literals    :    3 (   3 equ;   2 neg)
% 0.21/0.63  %            Maximal clause size   :    2 (   1 avg)
% 0.21/0.63  %            Maximal term depth    :    2 (   1 avg)
% 0.21/0.63  %            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
% 0.21/0.63  %            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
% 0.21/0.63  %            Number of variables   :    2 (   0 sgn)
% 0.21/0.63  % SPC      : CNF_UNS_RFO_PEQ_NUE
% 0.21/0.63  
% 0.21/0.63  % Comments :
% 0.21/0.63  %--------------------------------------------------------------------------
% 0.21/0.63  %----First part of denial clause: there exists a bird which is fond
% 0.21/0.63  %----of some other bird.
% 0.21/0.63  cnf(fond_bird_exists,hypothesis,
% 0.21/0.63      response(a,b) = b ).
% 0.21/0.63  
% 0.21/0.63  %----Hypothesis: Any bird that is fond of at least one bird must be happy.
% 0.21/0.63  %----  - FAx [If TEy (xy = y) then TEz TEw (xz = w) and (xw = z)].
% 0.21/0.63  %----  TEx -[- TEy (xy = y) | TEz TEw ((xz = w) and (xw = z))].
% 0.21/0.63  %----  TEx [ TEy (xy = y) and - TEz TEw ((xz = w) and (xw = z)) ].
% 0.21/0.63  %----  TEx [ TEy (xy = y) and FAz FAw -((xz = w) and (xw = z)) ].
% 0.21/0.63  %----  TEy (Ay = y) and FAz FAw -[(Az = w) and (Aw = z)].
% 0.21/0.63  %----  (AB = B) and [-(Az = w) | -(Aw = z)].
% 0.21/0.63  %----  Placing (AB = B) in the list of axiom, we have:
% 0.21/0.63  cnf(prove_happiness,negated_conjecture,
% 0.21/0.63      ( response(a,Z) != W
% 0.21/0.63      | response(a,W) != Z ) ).
% 0.21/0.63  
% 0.21/0.63  %--------------------------------------------------------------------------
% 0.21/0.63  %-------------------------------------------
% 0.21/0.63  % Proof found
% 0.21/0.63  % SZS status Theorem for theBenchmark
% 0.21/0.63  % SZS output start Proof
% 0.21/0.63  %ClaNum:7(EqnAxiom:5)
% 0.21/0.63  %VarNum:4(SingletonVarNum:2)
% 0.21/0.63  %MaxLitNum:2
% 0.21/0.63  %MaxfuncDepth:1
% 0.21/0.63  %SharedTerms:4
% 0.21/0.63  %goalClause: 7
% 0.21/0.63  [6]E(f3(a1,a2),a2)
% 0.21/0.63  [7]~E(f3(a1,x72),x71)+~E(f3(a1,x71),x72)
% 0.21/0.63  %EqnAxiom
% 0.21/0.63  [1]E(x11,x11)
% 0.21/0.63  [2]E(x22,x21)+~E(x21,x22)
% 0.21/0.63  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.21/0.63  [4]~E(x41,x42)+E(f3(x41,x43),f3(x42,x43))
% 0.21/0.63  [5]~E(x51,x52)+E(f3(x53,x51),f3(x53,x52))
% 0.21/0.63  
% 0.21/0.63  %-------------------------------------------
% 0.21/0.63  cnf(8,plain,
% 0.21/0.63     ($false),
% 0.21/0.63     inference(scs_inference,[],[6,7]),
% 0.21/0.63     ['proof']).
% 0.21/0.63  % SZS output end Proof
% 0.21/0.63  % Total time :0.000000s
%------------------------------------------------------------------------------