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