TSTP Solution File: MSC002-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MSC002-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 : n019.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.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MSC002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 24 13:37:44 EDT 2023
% 0.13/0.35 % 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 : MSC002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.61 % Domain : Miscellaneous
% 0.20/0.61 % Problem : A Blind Hand Problem
% 0.20/0.61 % Version : Especial.
% 0.20/0.61 % English :
% 0.20/0.61
% 0.20/0.61 % Refs : [Pop70] Popplestone (1970), Freddy, Things and Sets
% 0.20/0.61 % : [MRS72] Michie et al. (1972), G-deduction
% 0.20/0.61 % : [WM76] Wilson & Minker (1976), Resolution, Refinements, and S
% 0.20/0.61 % Source : [SPRFN]
% 0.20/0.61 % Names : DBABHP [MRS72]
% 0.20/0.61 % : DBABHP [WM76]
% 0.20/0.61
% 0.20/0.61 % Status : Unsatisfiable
% 0.20/0.61 % 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.25 v5.4.0, 0.10 v5.1.0, 0.09 v5.0.0, 0.00 v2.0.0
% 0.20/0.61 % Syntax : Number of clauses : 14 ( 3 unt; 1 nHn; 10 RR)
% 0.20/0.61 % Number of literals : 30 ( 0 equ; 17 neg)
% 0.20/0.61 % Maximal clause size : 3 ( 2 avg)
% 0.20/0.61 % Maximal term depth : 4 ( 1 avg)
% 0.20/0.61 % Number of predicates : 7 ( 7 usr; 0 prp; 1-3 aty)
% 0.20/0.61 % Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% 0.20/0.61 % Number of variables : 36 ( 8 sgn)
% 0.20/0.61 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.61
% 0.20/0.61 % Comments : The symbols are explained in [MRS72].
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 cnf(something_is_here_now,axiom,
% 0.20/0.61 at(something,here,now) ).
% 0.20/0.61
% 0.20/0.61 cnf(hand_let_go,axiom,
% 0.20/0.61 ( ~ hand_at(Place,Situation)
% 0.20/0.61 | hand_at(Place,let_go(Situation)) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(hand_go,axiom,
% 0.20/0.61 ( ~ hand_at(Place,Situation)
% 0.20/0.61 | hand_at(Another_place,go(Another_place,Situation)) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cant_hold_and_let_go,axiom,
% 0.20/0.61 ~ held(Thing,let_go(Situation)) ).
% 0.20/0.61
% 0.20/0.61 cnf(everything_is_red,axiom,
% 0.20/0.61 ( ~ at(Thing,here,Situation)
% 0.20/0.61 | red(Thing) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(situation_let_go,axiom,
% 0.20/0.61 ( ~ at(Thing,Place,Situation)
% 0.20/0.61 | at(Thing,Place,let_go(Situation)) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(situation_pick_up,axiom,
% 0.20/0.61 ( ~ at(Thing,Place,Situation)
% 0.20/0.61 | at(Thing,Place,pick_up(Situation)) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(can_grab_if_previously_let_go,axiom,
% 0.20/0.61 ( ~ at(Thing,Place,Situation)
% 0.20/0.61 | grabbed(Thing,pick_up(go(Place,let_go(Situation)))) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(answer_if_red_and_put_there,axiom,
% 0.20/0.61 ( ~ red(Thing)
% 0.20/0.61 | ~ put(Thing,there,Situation)
% 0.20/0.61 | answer(Situation) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(can_put_somewhere_if_grab_and_go_there,axiom,
% 0.20/0.61 ( ~ at(Thing,Place,Situation)
% 0.20/0.61 | ~ grabbed(Thing,Situation)
% 0.20/0.61 | put(Thing,Another_place,go(Another_place,Situation)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(thing_either_held_or_went_there,axiom,
% 0.20/0.62 ( held(Thing,Situation)
% 0.20/0.62 | ~ at(Thing,Place,Situation)
% 0.20/0.62 | at(Thing,Place,go(Another_place,Situation)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(thing_goes_in_hand,axiom,
% 0.20/0.62 ( ~ hand_at(One_place,Situation)
% 0.20/0.62 | ~ held(Thing,Situation)
% 0.20/0.62 | at(Thing,Place,go(Place,Situation)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(thing_picked_up_by_hand,axiom,
% 0.20/0.62 ( ~ hand_at(Place,Situation)
% 0.20/0.62 | ~ at(Thing,Place,Situation)
% 0.20/0.62 | held(Thing,pick_up(Situation)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(prove_there_is_an_answer_situation,negated_conjecture,
% 0.20/0.62 ~ answer(Situation) ).
% 0.20/0.62
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:14(EqnAxiom:0)
% 0.20/0.62 %VarNum:70(SingletonVarNum:36)
% 0.20/0.62 %MaxLitNum:3
% 0.20/0.62 %MaxfuncDepth:3
% 0.20/0.62 %SharedTerms:5
% 0.20/0.62 %goalClause: 2
% 0.20/0.62 %singleGoalClaCount:1
% 0.20/0.62 [1]P1(a1,a2,a4)
% 0.20/0.62 [2]~P2(x21)
% 0.20/0.62 [3]~P3(x31,f5(x32))
% 0.20/0.62 [6]P6(x61)+~P1(x61,a2,x62)
% 0.20/0.62 [4]~P4(x41,x42)+P4(x41,f5(x42))
% 0.20/0.62 [5]~P4(x53,x52)+P4(x51,f3(x51,x52))
% 0.20/0.62 [10]~P1(x101,x102,x103)+P1(x101,x102,f5(x103))
% 0.20/0.62 [11]~P1(x111,x112,x113)+P1(x111,x112,f6(x113))
% 0.20/0.62 [13]~P1(x131,x132,x133)+P5(x131,f6(f3(x132,f5(x133))))
% 0.20/0.62 [7]P2(x71)+~P6(x72)+~P7(x72,a7,x71)
% 0.20/0.62 [9]~P1(x91,x93,x92)+~P4(x93,x92)+P3(x91,f6(x92))
% 0.20/0.62 [8]~P3(x81,x83)+~P4(x84,x83)+P1(x81,x82,f3(x82,x83))
% 0.20/0.62 [12]~P1(x121,x123,x122)+P3(x121,x122)+P1(x121,x123,f3(x124,x122))
% 0.20/0.62 [14]~P5(x141,x143)+~P1(x141,x144,x143)+P7(x141,x142,f3(x142,x143))
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(23,plain,
% 0.20/0.62 (~P1(a1,x231,f6(f3(a2,f5(a4))))),
% 0.20/0.62 inference(scs_inference,[],[2,1,6,11,10,13,7,14])).
% 0.20/0.62 cnf(25,plain,
% 0.20/0.62 (P1(a1,a2,f3(x251,f5(a4)))),
% 0.20/0.62 inference(scs_inference,[],[2,1,3,6,11,10,13,7,14,12])).
% 0.20/0.62 cnf(29,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[23,25,11]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------