TSTP Solution File: MSC002-2 by CSE---1.6

View Problem - Process Solution

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

% Computer : n009.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 : Thu Aug 31 09:20:41 EDT 2023

% Result   : Unsatisfiable 0.50s 0.62s
% Output   : CNFRefutation 0.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem    : MSC002-2 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.10/0.32  % Computer : n009.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33  % CPULimit   : 300
% 0.10/0.33  % WCLimit    : 300
% 0.10/0.33  % DateTime   : Thu Aug 24 13:34:51 EDT 2023
% 0.10/0.33  % CPUTime    : 
% 0.16/0.57  start to proof:theBenchmark
% 0.50/0.62  %-------------------------------------------
% 0.50/0.62  % File        :CSE---1.6
% 0.50/0.62  % Problem     :theBenchmark
% 0.50/0.62  % Transform   :cnf
% 0.50/0.62  % Format      :tptp:raw
% 0.50/0.62  % Command     :java -jar mcs_scs.jar %d %s
% 0.50/0.62  
% 0.50/0.62  % Result      :Theorem 0.000000s
% 0.50/0.62  % Output      :CNFRefutation 0.000000s
% 0.50/0.62  %-------------------------------------------
% 0.50/0.62  %--------------------------------------------------------------------------
% 0.50/0.62  % File     : MSC002-2 : TPTP v8.1.2. Released v1.0.0.
% 0.50/0.62  % Domain   : Miscellaneous
% 0.50/0.62  % Problem  : A Blind Hand Problem
% 0.50/0.62  % Version  : Especial.
% 0.50/0.62  %            Theorem formulation : Without hand movement.
% 0.50/0.62  % English  :
% 0.50/0.62  
% 0.50/0.62  % Refs     : [Pop70] Popplestone (1970), Freddy, Things and Sets
% 0.50/0.62  %          : [MRS72] Michie et al. (1972), G-deduction
% 0.50/0.62  % Source   : [TPTP]
% 0.50/0.62  % Names    :
% 0.50/0.62  
% 0.50/0.62  % Status   : Unsatisfiable
% 0.50/0.62  % Rating   : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.11 v6.1.0, 0.14 v5.5.0, 0.12 v5.4.0, 0.10 v5.1.0, 0.09 v5.0.0, 0.00 v2.0.0
% 0.50/0.62  % Syntax   : Number of clauses     :   10 (   3 unt;   1 nHn;   8 RR)
% 0.50/0.62  %            Number of literals    :   20 (   0 equ;  11 neg)
% 0.50/0.62  %            Maximal clause size   :    3 (   2 avg)
% 0.50/0.62  %            Maximal term depth    :    4 (   1 avg)
% 0.50/0.62  %            Number of predicates  :    6 (   6 usr;   0 prp; 1-3 aty)
% 0.50/0.62  %            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
% 0.50/0.62  %            Number of variables   :   24 (   6 sgn)
% 0.50/0.62  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.50/0.62  
% 0.50/0.62  % Comments : Clauses about hand movement have been removed.
% 0.50/0.62  %--------------------------------------------------------------------------
% 0.50/0.62  cnf(something_is_here_now,axiom,
% 0.50/0.62      at(something,here,now) ).
% 0.50/0.62  
% 0.50/0.62  cnf(cant_hold_and_let_go,axiom,
% 0.50/0.62      ~ held(Thing,let_go(Situation)) ).
% 0.50/0.62  
% 0.50/0.62  cnf(everything_is_red,axiom,
% 0.50/0.62      ( ~ at(Thing,here,Situation)
% 0.50/0.62      | red(Thing) ) ).
% 0.50/0.62  
% 0.50/0.62  cnf(situation_let_go,axiom,
% 0.50/0.62      ( ~ at(Thing,Place,Situation)
% 0.50/0.62      | at(Thing,Place,let_go(Situation)) ) ).
% 0.50/0.62  
% 0.50/0.62  cnf(situation_pick_up,axiom,
% 0.50/0.62      ( ~ at(Thing,Place,Situation)
% 0.50/0.62      | at(Thing,Place,pick_up(Situation)) ) ).
% 0.50/0.62  
% 0.50/0.62  cnf(can_grab_if_previously_let_go,axiom,
% 0.50/0.62      ( ~ at(Thing,Place,Situation)
% 0.50/0.62      | grabbed(Thing,pick_up(go(Place,let_go(Situation)))) ) ).
% 0.50/0.62  
% 0.50/0.62  cnf(answer_if_red_and_put_there,axiom,
% 0.50/0.62      ( ~ red(Thing)
% 0.50/0.62      | ~ put(Thing,there,Situation)
% 0.50/0.62      | answer(Situation) ) ).
% 0.50/0.62  
% 0.50/0.62  cnf(can_put_somewhere_if_grab_and_go_there,axiom,
% 0.50/0.62      ( ~ at(Thing,Place,Situation)
% 0.50/0.62      | ~ grabbed(Thing,Situation)
% 0.50/0.62      | put(Thing,Another_place,go(Another_place,Situation)) ) ).
% 0.50/0.62  
% 0.50/0.62  cnf(thing_either_held_or_went_there,axiom,
% 0.50/0.62      ( held(Thing,Situation)
% 0.50/0.62      | ~ at(Thing,Place,Situation)
% 0.50/0.62      | at(Thing,Place,go(Another_place,Situation)) ) ).
% 0.50/0.62  
% 0.50/0.62  cnf(prove_there_is_an_answer_situation,negated_conjecture,
% 0.50/0.62      ~ answer(Situation) ).
% 0.50/0.62  
% 0.50/0.62  %--------------------------------------------------------------------------
% 0.50/0.62  %-------------------------------------------
% 0.50/0.62  % Proof found
% 0.50/0.62  % SZS status Theorem for theBenchmark
% 0.50/0.62  % SZS output start Proof
% 0.50/0.62  %ClaNum:10(EqnAxiom:0)
% 0.50/0.62  %VarNum:46(SingletonVarNum:24)
% 0.50/0.62  %MaxLitNum:3
% 0.50/0.62  %MaxfuncDepth:3
% 0.50/0.62  %SharedTerms:5
% 0.50/0.62  %goalClause: 2
% 0.50/0.62  %singleGoalClaCount:1
% 0.50/0.62  [1]P1(a1,a2,a4)
% 0.50/0.62  [2]~P2(x21)
% 0.50/0.62  [3]~P3(x31,f5(x32))
% 0.50/0.62  [4]P5(x41)+~P1(x41,a2,x42)
% 0.50/0.62  [6]~P1(x61,x62,x63)+P1(x61,x62,f5(x63))
% 0.50/0.62  [7]~P1(x71,x72,x73)+P1(x71,x72,f6(x73))
% 0.50/0.62  [9]~P1(x91,x92,x93)+P4(x91,f6(f3(x92,f5(x93))))
% 0.50/0.62  [5]P2(x51)+~P5(x52)+~P6(x52,a7,x51)
% 0.50/0.62  [8]~P1(x81,x83,x82)+P3(x81,x82)+P1(x81,x83,f3(x84,x82))
% 0.50/0.62  [10]~P4(x101,x103)+~P1(x101,x104,x103)+P6(x101,x102,f3(x102,x103))
% 0.50/0.62  %EqnAxiom
% 0.50/0.62  
% 0.50/0.62  %-------------------------------------------
% 0.50/0.62  cnf(19,plain,
% 0.50/0.62     (~P1(a1,x191,f6(f3(a2,f5(a4))))),
% 0.50/0.62     inference(scs_inference,[],[2,1,4,7,6,9,5,10])).
% 0.50/0.62  cnf(21,plain,
% 0.50/0.62     (P1(a1,a2,f3(x211,f5(a4)))),
% 0.50/0.62     inference(scs_inference,[],[2,1,3,4,7,6,9,5,10,8])).
% 0.50/0.62  cnf(23,plain,
% 0.50/0.62     ($false),
% 0.50/0.62     inference(scs_inference,[],[19,21,7]),
% 0.50/0.62     ['proof']).
% 0.50/0.62  % SZS output end Proof
% 0.50/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------