TSTP Solution File: PLA001-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : PLA001-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 : Thu Aug 31 12:58:57 EDT 2023
% Result : Unsatisfiable 0.20s 0.65s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PLA001-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.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 05:58:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 0.20/0.65 %-------------------------------------------
% 0.20/0.65 % File :CSE---1.6
% 0.20/0.65 % Problem :theBenchmark
% 0.20/0.65 % Transform :cnf
% 0.20/0.65 % Format :tptp:raw
% 0.20/0.65 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.65
% 0.20/0.65 % Result :Theorem 0.010000s
% 0.20/0.65 % Output :CNFRefutation 0.010000s
% 0.20/0.65 %-------------------------------------------
% 0.20/0.65 %--------------------------------------------------------------------------
% 0.20/0.65 % File : PLA001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.65 % Domain : Planning
% 0.20/0.65 % Problem : Cheyenne to DesMoines, buying a loaf of bread on the way
% 0.20/0.65 % Version : Especial.
% 0.20/0.65 % English : The problem is to drive from Cheyenne, Wyoming to Des Moines,
% 0.20/0.65 % Iowa and end up there with a loaf of bread. A portion of the
% 0.20/0.65 % road map is expressed in clause form. The allowable actions
% 0.20/0.65 % are to drive from a city to a neighboring city, to buy a loaf
% 0.20/0.65 % of bread at a city, and to wait_at at a city for one unit
% 0.20/0.65 % of time. Buying a loaf of bread takes one unit of time and
% 0.20/0.65 % driving to a neighboring city takes two units of time.
% 0.20/0.65
% 0.20/0.65 % Refs : [Pla81] Plaisted (1981), Theorem Proving with Abstraction
% 0.20/0.65 % Source : [Pla81]
% 0.20/0.65 % Names : - [Pla81]
% 0.20/0.65
% 0.20/0.65 % Status : Unsatisfiable
% 0.20/0.65 % Rating : 0.00 v7.4.0, 0.17 v7.3.0, 0.00 v6.1.0, 0.21 v6.0.0, 0.33 v5.5.0, 0.25 v5.4.0, 0.28 v5.3.0, 0.35 v5.2.0, 0.23 v5.1.0, 0.19 v5.0.0, 0.13 v4.1.0, 0.20 v4.0.1, 0.14 v3.4.0, 0.00 v3.2.0, 0.33 v3.1.0, 0.00 v2.7.0, 0.12 v2.6.0, 0.14 v2.4.0, 0.14 v2.3.0, 0.14 v2.2.1, 0.22 v2.1.0, 0.00 v2.0.0
% 0.20/0.65 % Syntax : Number of clauses : 16 ( 12 unt; 0 nHn; 16 RR)
% 0.20/0.65 % Number of literals : 22 ( 0 equ; 7 neg)
% 0.20/0.65 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.65 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.65 % Number of predicates : 2 ( 2 usr; 0 prp; 2-4 aty)
% 0.20/0.65 % Number of functors : 18 ( 18 usr; 14 con; 0-2 aty)
% 0.20/0.65 % Number of variables : 20 ( 2 sgn)
% 0.20/0.65 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.65
% 0.20/0.65 % Comments :
% 0.20/0.65 %--------------------------------------------------------------------------
% 0.20/0.65 cnf(drive1,axiom,
% 0.20/0.65 ( ~ at(FromCity,Loaves,Time,Situation)
% 0.20/0.65 | ~ next_to(FromCity,ToCity)
% 0.20/0.65 | at(ToCity,Loaves,s(s(Time)),drive(ToCity,Situation)) ) ).
% 0.20/0.65
% 0.20/0.65 cnf(drive2,axiom,
% 0.20/0.65 ( ~ at(FromCity,Loaves,Time,Situation)
% 0.20/0.65 | ~ next_to(ToCity,FromCity)
% 0.20/0.65 | at(ToCity,Loaves,s(s(Time)),drive(ToCity,Situation)) ) ).
% 0.20/0.65
% 0.20/0.65 cnf(wait_in_city,axiom,
% 0.20/0.65 ( ~ at(City,Loaves,Time,Situation)
% 0.20/0.65 | at(City,Loaves,s(Time),wait_at(Situation)) ) ).
% 0.20/0.65
% 0.20/0.65 cnf(buy_in_city,axiom,
% 0.20/0.65 ( ~ at(City,Loaves,Time,Situation)
% 0.20/0.65 | at(City,s(Loaves),s(Time),buy(Situation)) ) ).
% 0.20/0.65
% 0.20/0.65 cnf(map1,hypothesis,
% 0.20/0.65 next_to(winnemucca,elko) ).
% 0.20/0.65
% 0.20/0.65 cnf(map2,hypothesis,
% 0.20/0.65 next_to(elko,saltLakeCity) ).
% 0.20/0.65
% 0.20/0.65 cnf(map3,hypothesis,
% 0.20/0.65 next_to(saltLakeCity,rockSprings) ).
% 0.20/0.65
% 0.20/0.65 cnf(map4,hypothesis,
% 0.20/0.65 next_to(rockSprings,laramie) ).
% 0.20/0.65
% 0.20/0.65 cnf(map5,hypothesis,
% 0.20/0.65 next_to(laramie,cheyenne) ).
% 0.20/0.65
% 0.20/0.65 cnf(map6,hypothesis,
% 0.20/0.65 next_to(cheyenne,northPlatte) ).
% 0.20/0.65
% 0.20/0.65 cnf(map7,hypothesis,
% 0.20/0.65 next_to(northPlatte,grandIsland) ).
% 0.20/0.65
% 0.20/0.65 cnf(map8,hypothesis,
% 0.20/0.65 next_to(grandIsland,lincoln) ).
% 0.20/0.65
% 0.20/0.65 cnf(map9,hypothesis,
% 0.20/0.65 next_to(lincoln,omaha) ).
% 0.20/0.65
% 0.20/0.65 cnf(map10,hypothesis,
% 0.20/0.65 next_to(omaha,desMoines) ).
% 0.20/0.65
% 0.20/0.65 cnf(initial,hypothesis,
% 0.20/0.65 at(cheyenne,none,start,initial_situation) ).
% 0.20/0.65
% 0.20/0.65 cnf(prove_you_gat_get_there_with_bread,negated_conjecture,
% 0.20/0.65 ~ at(desMoines,s(none),Time,Situation) ).
% 0.20/0.65
% 0.20/0.65 %--------------------------------------------------------------------------
% 0.20/0.65 %-------------------------------------------
% 0.20/0.65 % Proof found
% 0.20/0.65 % SZS status Theorem for theBenchmark
% 0.20/0.65 % SZS output start Proof
% 0.20/0.66 %ClaNum:16(EqnAxiom:0)
% 0.20/0.66 %VarNum:40(SingletonVarNum:20)
% 0.20/0.66 %MaxLitNum:3
% 0.20/0.66 %MaxfuncDepth:2
% 0.20/0.66 %SharedTerms:26
% 0.20/0.66 %goalClause: 12
% 0.20/0.66 %singleGoalClaCount:1
% 0.20/0.66 [1]P1(a1,a2)
% 0.20/0.66 [2]P1(a2,a7)
% 0.20/0.66 [3]P1(a7,a8)
% 0.20/0.66 [4]P1(a8,a9)
% 0.20/0.66 [5]P1(a9,a3)
% 0.20/0.66 [6]P1(a3,a12)
% 0.20/0.66 [7]P1(a12,a10)
% 0.20/0.66 [8]P1(a10,a13)
% 0.20/0.66 [9]P1(a13,a15)
% 0.20/0.66 [10]P1(a15,a5)
% 0.20/0.66 [11]P2(a3,a14,a17,a11)
% 0.20/0.66 [12]~P2(a5,f16(a14),x121,x122)
% 0.20/0.66 [13]~P2(x131,x132,x133,x134)+P2(x131,x132,f16(x133),f18(x134))
% 0.20/0.66 [14]~P2(x141,x142,x143,x144)+P2(x141,f16(x142),f16(x143),f4(x144))
% 0.20/0.66 [15]~P2(x155,x152,x153,x154)+~P1(x151,x155)+P2(x151,x152,f16(f16(x153)),f6(x151,x154))
% 0.20/0.66 [16]~P2(x165,x162,x163,x164)+~P1(x165,x161)+P2(x161,x162,f16(f16(x163)),f6(x161,x164))
% 0.20/0.66 %EqnAxiom
% 0.20/0.66
% 0.20/0.66 %-------------------------------------------
% 0.20/0.66 cnf(17,plain,
% 0.20/0.66 (~P2(a5,a14,x171,x172)),
% 0.20/0.66 inference(scs_inference,[],[12,14])).
% 0.20/0.66 cnf(18,plain,
% 0.20/0.66 (~P2(a5,f16(a14),x181,x182)),
% 0.20/0.66 inference(rename_variables,[],[12])).
% 0.20/0.66 cnf(19,plain,
% 0.20/0.66 (~P2(a15,f16(a14),x191,x192)),
% 0.20/0.66 inference(scs_inference,[],[12,18,10,14,16])).
% 0.20/0.66 cnf(24,plain,
% 0.20/0.66 (P2(a3,a14,f16(a17),f18(a11))),
% 0.20/0.66 inference(scs_inference,[],[12,18,10,11,14,16,15,13])).
% 0.20/0.66 cnf(28,plain,
% 0.20/0.66 (P2(a12,a14,f16(f16(a17)),f6(a12,a11))),
% 0.20/0.66 inference(scs_inference,[],[6,11,14,16])).
% 0.20/0.66 cnf(33,plain,
% 0.20/0.66 (~P2(a15,f16(a14),x331,x332)),
% 0.20/0.66 inference(rename_variables,[],[19])).
% 0.20/0.66 cnf(35,plain,
% 0.20/0.66 (~P2(a13,f16(a14),x351,x352)),
% 0.20/0.66 inference(scs_inference,[],[9,19,33,14,16])).
% 0.20/0.66 cnf(47,plain,
% 0.20/0.66 (~P2(a13,a14,x471,x472)),
% 0.20/0.66 inference(scs_inference,[],[35,14])).
% 0.20/0.66 cnf(65,plain,
% 0.20/0.66 (~P2(a10,a14,x651,x652)),
% 0.20/0.66 inference(scs_inference,[],[8,24,17,47,15,16])).
% 0.20/0.66 cnf(68,plain,
% 0.20/0.66 ($false),
% 0.20/0.66 inference(scs_inference,[],[7,28,65,16]),
% 0.20/0.66 ['proof']).
% 0.20/0.66 % SZS output end Proof
% 0.20/0.66 % Total time :0.010000s
%------------------------------------------------------------------------------