%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : PLA002-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 : 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 : Mon Jun 24 13:35:27 EDT 2024 % Result : Unsatisfiable 0.53s 0.61s % Output : CNFRefutation 0.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : PLA002-1 : TPTP v8.2.0. Released v1.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n009.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:43:38 EDT 2024 % 0.12/0.33 % CPUTime : % 0.53/0.56 start to proof:theBenchmark % 0.53/0.60 %------------------------------------------- % 0.53/0.60 % File :CSE---1.7 % 0.53/0.60 % Problem :theBenchmark % 0.53/0.60 % Transform :cnf % 0.53/0.60 % Format :tptp:raw % 0.53/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.60 % 0.53/0.60 % Result :Theorem 0.000000s % 0.53/0.60 % Output :CNFRefutation 0.000000s % 0.53/0.60 %------------------------------------------- % 0.53/0.61 %-------------------------------------------------------------------------- % 0.53/0.61 % File : PLA002-1 : TPTP v8.2.0. Released v1.0.0. % 0.53/0.61 % Domain : Planning % 0.53/0.61 % Problem : Getting from here to there, in all weather % 0.53/0.61 % Version : Especial. % 0.53/0.61 % English : The problem is to travel from one place to another. % 0.53/0.61 % Certain paths are passable at different times of the year, so % 0.53/0.61 % a conditional plan must be generated. Either all situations % 0.53/0.61 % are cold or all situations are warm. There is a river which % 0.53/0.61 % may be crossed only in winter when it is covered with ice, % 0.53/0.61 % and a mountain range may be crossed only in summer. The % 0.53/0.61 % problem is to get from city F to city A. % 0.53/0.61 % 0.53/0.61 % Refs : [Pla82] Plaisted (1982), A Simplified Problem Reduction Format % 0.53/0.61 % Source : [Pla82] % 0.53/0.61 % Names : Problem 5.7 [Pla82] % 0.53/0.61 % 0.53/0.61 % Status : Unsatisfiable % 0.53/0.61 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v2.0.0 % 0.53/0.61 % Syntax : Number of clauses : 17 ( 2 unt; 1 nHn; 16 RR) % 0.53/0.61 % Number of literals : 36 ( 0 equ; 19 neg) % 0.53/0.61 % Maximal clause size : 3 ( 2 avg) % 0.53/0.61 % Maximal term depth : 2 ( 1 avg) % 0.53/0.61 % Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty) % 0.53/0.61 % Number of functors : 12 ( 12 usr; 7 con; 0-2 aty) % 0.53/0.61 % Number of variables : 17 ( 3 sgn) % 0.53/0.61 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.53/0.61 % 0.53/0.61 % Comments : % 0.53/0.61 %-------------------------------------------------------------------------- % 0.53/0.61 cnf(warm_or_cold,hypothesis, % 0.53/0.61 ( warm(Situation1) % 0.53/0.61 | cold(Situation2) ) ). % 0.53/0.61 % 0.53/0.61 cnf(walk_a_to_b,hypothesis, % 0.53/0.61 ( ~ at(a,Situation) % 0.53/0.61 | at(b,walk(b,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(drive_a_to_b,hypothesis, % 0.53/0.61 ( ~ at(a,Situation) % 0.53/0.61 | at(b,drive(b,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(walk_b_to_a,hypothesis, % 0.53/0.61 ( ~ at(b,Situation) % 0.53/0.61 | at(a,walk(a,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(drive_b_to_a,hypothesis, % 0.53/0.61 ( ~ at(b,Situation) % 0.53/0.61 | at(a,drive(a,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(cross_river_b_to_c,hypothesis, % 0.53/0.61 ( ~ cold(Situation) % 0.53/0.61 | ~ at(b,Situation) % 0.53/0.61 | at(c,skate(c,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(cross_river_c_to_b,hypothesis, % 0.53/0.61 ( ~ cold(Situation) % 0.53/0.61 | ~ at(c,Situation) % 0.53/0.61 | at(b,skate(b,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(climb_mountain_b_to_d,hypothesis, % 0.53/0.61 ( ~ warm(Situation) % 0.53/0.61 | ~ at(b,Situation) % 0.53/0.61 | at(d,climb(d,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(climb_mountain_d_to_b,hypothesis, % 0.53/0.61 ( ~ warm(Situation) % 0.53/0.61 | ~ at(d,Situation) % 0.53/0.61 | at(b,climb(b,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(go_c_to_d,hypothesis, % 0.53/0.61 ( ~ at(c,Situation) % 0.53/0.61 | at(d,go(d,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(go_d_to_c,hypothesis, % 0.53/0.61 ( ~ at(d,Situation) % 0.53/0.61 | at(c,go(c,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(go_c_to_e,hypothesis, % 0.53/0.61 ( ~ at(c,Situation) % 0.53/0.61 | at(e,go(e,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(go_e_to_c,hypothesis, % 0.53/0.61 ( ~ at(e,Situation) % 0.53/0.61 | at(c,go(c,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(go_d_to_f,hypothesis, % 0.53/0.61 ( ~ at(d,Situation) % 0.53/0.61 | at(f,go(f,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(go_f_to_d,hypothesis, % 0.53/0.61 ( ~ at(f,Situation) % 0.53/0.61 | at(d,go(d,Situation)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(initial,hypothesis, % 0.53/0.61 at(f,s0) ). % 0.53/0.61 % 0.53/0.61 cnf(prove_you_can_get_to_a,negated_conjecture, % 0.53/0.61 ~ at(a,S) ). % 0.53/0.61 % 0.53/0.61 %-------------------------------------------------------------------------- % 0.53/0.61 %------------------------------------------- % 0.53/0.61 % Proof found % 0.53/0.61 % SZS status Theorem for theBenchmark % 0.53/0.61 % SZS output start Proof % 0.53/0.61 %ClaNum:17(EqnAxiom:0) % 0.53/0.61 %VarNum:31(SingletonVarNum:15) % 0.53/0.61 %MaxLitNum:3 % 0.53/0.61 %MaxfuncDepth:1 % 0.53/0.61 %SharedTerms:8 % 0.53/0.61 %goalClause: 2 % 0.53/0.61 %singleGoalClaCount:1 % 0.53/0.61 [1]P1(a1,a9) % 0.53/0.61 [2]~P1(a2,x21) % 0.53/0.61 [4]~P1(a3,x41)+P1(a2,f11(a2,x41)) % 0.53/0.61 [5]~P1(a3,x51)+P1(a2,f4(a2,x51)) % 0.53/0.61 [8]~P1(a6,x81)+P1(a5,f10(a5,x81)) % 0.53/0.61 [9]~P1(a8,x91)+P1(a5,f10(a5,x91)) % 0.53/0.61 [10]~P1(a5,x101)+P1(a6,f10(a6,x101)) % 0.53/0.61 [11]~P1(a1,x111)+P1(a6,f10(a6,x111)) % 0.53/0.61 [12]~P1(a5,x121)+P1(a8,f10(a8,x121)) % 0.53/0.61 [13]~P1(a6,x131)+P1(a1,f10(a1,x131)) % 0.53/0.61 [3]P2(x31)+P3(x32) % 0.53/0.61 [14]~P3(x141)+~P1(a5,x141)+P1(a3,f12(a3,x141)) % 0.53/0.61 [15]~P2(x151)+~P1(a6,x151)+P1(a3,f7(a3,x151)) % 0.53/0.61 [16]~P3(x161)+~P1(a3,x161)+P1(a5,f12(a5,x161)) % 0.53/0.61 [17]~P2(x171)+~P1(a3,x171)+P1(a6,f7(a6,x171)) % 0.53/0.61 %EqnAxiom % 0.53/0.61 % 0.53/0.61 %------------------------------------------- % 0.53/0.61 cnf(18,plain, % 0.53/0.61 (~P1(a3,x181)), % 0.53/0.61 inference(scs_inference,[],[2,4])). % 0.53/0.61 cnf(26,plain, % 0.53/0.61 (~P3(f10(a5,f10(a6,a9)))), % 0.53/0.61 inference(scs_inference,[],[2,1,4,14,8,9,10,11])). % 0.53/0.61 cnf(27,plain, % 0.53/0.61 (P2(x271)), % 0.53/0.61 inference(scs_inference,[],[26,3])). % 0.53/0.61 cnf(28,plain, % 0.53/0.61 (~P2(x281)+~P1(a6,x281)), % 0.53/0.61 inference(scs_inference,[],[18,15])). % 0.53/0.61 cnf(33,plain, % 0.53/0.61 (~P1(a5,x331)), % 0.53/0.61 inference(scs_inference,[],[27,28,10])). % 0.53/0.61 cnf(35,plain, % 0.53/0.61 (~P1(a5,x351)), % 0.53/0.61 inference(rename_variables,[],[33])). % 0.53/0.61 cnf(38,plain, % 0.53/0.61 ($false), % 0.53/0.61 inference(scs_inference,[],[33,35,1,9,8,11]), % 0.53/0.61 ['proof']). % 0.53/0.61 % SZS output end Proof % 0.53/0.61 % Total time :0.000000s %------------------------------------------------------------------------------