%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : PLA003-1 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n007.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 : Mon Jun 24 13:35:27 EDT 2024 % Result : Unsatisfiable 0.52s 0.61s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : PLA003-1 : TPTP v8.2.0. Released v1.0.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n007.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 : Tue Jun 18 16:57:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.52/0.56 start to proof:theBenchmark % 0.52/0.61 %------------------------------------------- % 0.52/0.61 % File :CSE---1.7 % 0.52/0.61 % Problem :theBenchmark % 0.52/0.61 % Transform :cnf % 0.52/0.61 % Format :tptp:raw % 0.52/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.61 % 0.52/0.61 % Result :Theorem 0.000000s % 0.52/0.61 % Output :CNFRefutation 0.000000s % 0.52/0.61 %------------------------------------------- % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 % File : PLA003-1 : TPTP v8.2.0. Released v1.0.0. % 0.52/0.61 % Domain : Planning % 0.52/0.61 % Problem : Monkey and Bananas Problem % 0.52/0.61 % Version : Especial. % 0.52/0.61 % English : % 0.52/0.61 % 0.52/0.61 % Refs : % 0.52/0.61 % Source : [SPRFN] % 0.52/0.61 % Names : % 0.52/0.61 % 0.52/0.61 % Status : Unsatisfiable % 0.52/0.61 % Rating : 0.00 v5.3.0, 0.05 v5.2.0, 0.00 v2.2.1, 0.11 v2.1.0, 0.00 v2.0.0 % 0.52/0.61 % Syntax : Number of clauses : 11 ( 2 unt; 0 nHn; 8 RR) % 0.52/0.61 % Number of literals : 20 ( 0 equ; 10 neg) % 0.52/0.61 % Maximal clause size : 2 ( 1 avg) % 0.52/0.61 % Maximal term depth : 2 ( 1 avg) % 0.52/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.52/0.61 % Number of functors : 11 ( 11 usr; 8 con; 0-3 aty) % 0.52/0.61 % Number of variables : 31 ( 7 sgn) % 0.52/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.52/0.61 % 0.52/0.61 % Comments : Formulated as a state space. % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 %----Format of a situation is % 0.52/0.61 %----(monkey(loc,height,has),ladder(loc,height),bananas(loc,height)) % 0.52/0.61 %----can(S) means situation S is attainable % 0.52/0.61 % 0.52/0.61 cnf(climb_up,axiom, % 0.52/0.61 ( can(monkey(Location1,ceiling,nothing),ladder(Location1,floor),Bananas) % 0.52/0.61 | ~ can(monkey(Location1,floor,nothing),ladder(Location1,floor),Bananas) ) ). % 0.52/0.61 % 0.52/0.61 cnf(climb_down,axiom, % 0.52/0.61 ( can(monkey(Location1,floor,nothing),ladder(Location1,floor),Bananas) % 0.52/0.61 | ~ can(monkey(Location1,ceiling,nothing),ladder(Location1,floor),Bananas) ) ). % 0.52/0.61 % 0.52/0.61 cnf(go_holding_ladder,axiom, % 0.52/0.61 ( can(monkey(Location2,floor,the_ladder),ladder(Location2,floor),Bananas) % 0.52/0.61 | ~ can(monkey(Location1,floor,the_ladder),ladder(Location1,floor),Bananas) ) ). % 0.52/0.61 % 0.52/0.61 cnf(go_holding_bananas,axiom, % 0.52/0.61 ( can(monkey(Location2,floor,the_bananas),Ladder,bananas(Location2,floor)) % 0.52/0.61 | ~ can(monkey(Location1,floor,the_bananas),Ladder,bananas(Location1,floor)) ) ). % 0.52/0.61 % 0.52/0.61 cnf(go_holding_nothing,axiom, % 0.52/0.61 ( can(monkey(Location2,floor,nothing),Ladder,Bananas) % 0.52/0.61 | ~ can(monkey(Location1,floor,nothing),Ladder,Bananas) ) ). % 0.52/0.61 % 0.52/0.61 cnf(drop_ladder,axiom, % 0.52/0.61 ( can(monkey(Location,Height,nothing),ladder(Location,floor),Bananas) % 0.52/0.61 | ~ can(monkey(Location,Height,the_ladder),ladder(Location,Any_height),Bananas) ) ). % 0.52/0.61 % 0.52/0.61 cnf(drop_bananas,axiom, % 0.52/0.61 ( can(monkey(Location,Height,nothing),Ladder,bananas(Location,floor)) % 0.52/0.61 | ~ can(monkey(Location,Height,the_bananas),Ladder,bananas(Location,Height)) ) ). % 0.52/0.61 % 0.52/0.61 cnf(grab_bananas,axiom, % 0.52/0.61 ( can(monkey(Location,Height,the_bananas),Ladder,bananas(Location,Height)) % 0.52/0.61 | ~ can(monkey(Location,Height,nothing),Ladder,bananas(Location,Height)) ) ). % 0.52/0.61 % 0.52/0.61 cnf(grab_ladder,axiom, % 0.52/0.61 ( can(monkey(Location,Height,the_ladder),ladder(Location,Height),Bananas) % 0.52/0.61 | ~ can(monkey(Location,Height,nothing),ladder(Location,Height),Bananas) ) ). % 0.52/0.61 % 0.52/0.61 cnf(initial_situation,hypothesis, % 0.52/0.61 can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ). % 0.52/0.61 % 0.52/0.61 cnf(prove_the_monkey_can_get_the_bananas,negated_conjecture, % 0.52/0.61 ~ can(monkey(Somewhere,Some_height,the_bananas),Ladder,What) ). % 0.52/0.61 % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 %------------------------------------------- % 0.52/0.61 % Proof found % 0.52/0.61 % SZS status Theorem for theBenchmark % 0.52/0.61 % SZS output start Proof % 0.52/0.61 %ClaNum:11(EqnAxiom:0) % 0.52/0.61 %VarNum:57(SingletonVarNum:25) % 0.52/0.61 %MaxLitNum:2 % 0.52/0.61 %MaxfuncDepth:1 % 0.52/0.61 %SharedTerms:12 % 0.52/0.61 %goalClause: 2 % 0.52/0.61 %singleGoalClaCount:1 % 0.52/0.61 [1]P1(f6(a1,a2,a5),f8(a7,a2),f4(a9,a3)) % 0.52/0.61 [2]~P1(f6(x21,x22,a10),x23,x24) % 0.52/0.61 [5]~P1(f6(x51,a2,a5),f8(x51,a2),x52)+P1(f6(x51,a3,a5),f8(x51,a2),x52) % 0.52/0.61 [6]~P1(f6(x61,a3,a5),f8(x61,a2),x62)+P1(f6(x61,a2,a5),f8(x61,a2),x62) % 0.52/0.61 [7]P1(f6(x71,a2,a11),f8(x71,a2),x72)+~P1(f6(x73,a2,a11),f8(x73,a2),x72) % 0.52/0.61 [10]~P1(f6(x101,x102,a5),x103,f4(x101,x102))+P1(f6(x101,x102,a10),x103,f4(x101,x102)) % 0.52/0.61 [11]~P1(f6(x111,x112,a5),f8(x111,x112),x113)+P1(f6(x111,x112,a11),f8(x111,x112),x113) % 0.52/0.61 [3]P1(f6(x31,a2,a5),x32,x33)+~P1(f6(x34,a2,a5),x32,x33) % 0.52/0.61 [9]~P1(f6(x91,x92,a11),f8(x91,x94),x93)+P1(f6(x91,x92,a5),f8(x91,a2),x93) % 0.52/0.61 %EqnAxiom % 0.52/0.61 % 0.52/0.61 %------------------------------------------- % 0.52/0.61 cnf(12,plain, % 0.52/0.61 (~P1(f6(x121,x122,a5),x123,f4(x121,x122))), % 0.52/0.62 inference(scs_inference,[],[2,10])). % 0.52/0.62 cnf(27,plain, % 0.52/0.62 (~P1(f6(x271,a2,a5),f8(x272,a2),f4(x272,a3))), % 0.52/0.62 inference(scs_inference,[],[12,5,3])). % 0.52/0.62 cnf(35,plain, % 0.52/0.62 ($false), % 0.52/0.62 inference(scs_inference,[],[1,27,9,7,11,3]), % 0.52/0.62 ['proof']). % 0.52/0.62 % SZS output end Proof % 0.52/0.62 % Total time :0.000000s %------------------------------------------------------------------------------