TSTP Solution File: PLA001-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PLA001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n014.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 : Tue Aug 22 10:53:34 EDT 2023
% Result : Unsatisfiable 3.22s 1.79s
% Output : CNFRefutation 3.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 29
% Syntax : Number of formulae : 50 ( 21 unt; 20 typ; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 19 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 18 ( 18 usr; 14 con; 0-2 aty)
% Number of variables : 49 (; 49 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ at > next_to > drive > #nlpp > wait_at > s > buy > winnemucca > start > saltLakeCity > rockSprings > omaha > northPlatte > none > lincoln > laramie > initial_situation > grandIsland > elko > desMoines > cheyenne
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(winnemucca,type,
winnemucca: $i ).
tff(cheyenne,type,
cheyenne: $i ).
tff(saltLakeCity,type,
saltLakeCity: $i ).
tff(rockSprings,type,
rockSprings: $i ).
tff(s,type,
s: $i > $i ).
tff(start,type,
start: $i ).
tff(laramie,type,
laramie: $i ).
tff(next_to,type,
next_to: ( $i * $i ) > $o ).
tff(omaha,type,
omaha: $i ).
tff(grandIsland,type,
grandIsland: $i ).
tff(wait_at,type,
wait_at: $i > $i ).
tff(drive,type,
drive: ( $i * $i ) > $i ).
tff(none,type,
none: $i ).
tff(initial_situation,type,
initial_situation: $i ).
tff(northPlatte,type,
northPlatte: $i ).
tff(lincoln,type,
lincoln: $i ).
tff(elko,type,
elko: $i ).
tff(at,type,
at: ( $i * $i * $i * $i ) > $o ).
tff(buy,type,
buy: $i > $i ).
tff(desMoines,type,
desMoines: $i ).
tff(f_59,axiom,
next_to(cheyenne,northPlatte),
file(unknown,unknown) ).
tff(f_35,axiom,
! [FromCity,Loaves,Situation,Time,ToCity] :
( ~ at(FromCity,Loaves,Time,Situation)
| ~ next_to(FromCity,ToCity)
| at(ToCity,Loaves,s(s(Time)),drive(ToCity,Situation)) ),
file(unknown,unknown) ).
tff(f_60,axiom,
next_to(northPlatte,grandIsland),
file(unknown,unknown) ).
tff(f_61,axiom,
next_to(grandIsland,lincoln),
file(unknown,unknown) ).
tff(f_62,axiom,
next_to(lincoln,omaha),
file(unknown,unknown) ).
tff(f_63,axiom,
next_to(omaha,desMoines),
file(unknown,unknown) ).
tff(f_53,axiom,
! [City,Loaves,Time,Situation] :
( ~ at(City,Loaves,Time,Situation)
| at(City,s(Loaves),s(Time),buy(Situation)) ),
file(unknown,unknown) ).
tff(f_67,axiom,
! [Time,Situation] : ~ at(desMoines,s(none),Time,Situation),
file(unknown,unknown) ).
tff(f_64,axiom,
at(cheyenne,none,start,initial_situation),
file(unknown,unknown) ).
tff(c_20,plain,
next_to(cheyenne,northPlatte),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_52,plain,
! [Situation_35,Loaves_33,FromCity_37,Time_34,ToCity_36] :
( at(ToCity_36,Loaves_33,s(s(Time_34)),drive(ToCity_36,Situation_35))
| ~ next_to(FromCity_37,ToCity_36)
| ~ at(FromCity_37,Loaves_33,Time_34,Situation_35) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_73,plain,
! [Loaves_33,Time_34,Situation_35] :
( at(northPlatte,Loaves_33,s(s(Time_34)),drive(northPlatte,Situation_35))
| ~ at(cheyenne,Loaves_33,Time_34,Situation_35) ),
inference(resolution,[status(thm)],[c_20,c_52]) ).
tff(c_22,plain,
next_to(northPlatte,grandIsland),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_75,plain,
! [Loaves_33,Time_34,Situation_35] :
( at(grandIsland,Loaves_33,s(s(Time_34)),drive(grandIsland,Situation_35))
| ~ at(northPlatte,Loaves_33,Time_34,Situation_35) ),
inference(resolution,[status(thm)],[c_22,c_52]) ).
tff(c_24,plain,
next_to(grandIsland,lincoln),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_206,plain,
! [Loaves_105,Time_106,Situation_107] :
( at(lincoln,Loaves_105,s(s(Time_106)),drive(lincoln,Situation_107))
| ~ at(grandIsland,Loaves_105,Time_106,Situation_107) ),
inference(resolution,[status(thm)],[c_24,c_52]) ).
tff(c_26,plain,
next_to(lincoln,omaha),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_168,plain,
! [Loaves_98,Time_99,Situation_100] :
( at(omaha,Loaves_98,s(s(Time_99)),drive(omaha,Situation_100))
| ~ at(lincoln,Loaves_98,Time_99,Situation_100) ),
inference(resolution,[status(thm)],[c_26,c_52]) ).
tff(c_28,plain,
next_to(omaha,desMoines),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_84,plain,
! [Loaves_41,Time_42,Situation_43] :
( at(desMoines,Loaves_41,s(s(Time_42)),drive(desMoines,Situation_43))
| ~ at(omaha,Loaves_41,Time_42,Situation_43) ),
inference(resolution,[status(thm)],[c_28,c_52]) ).
tff(c_40,plain,
! [City_27,Loaves_28,Time_29,Situation_30] :
( at(City_27,s(Loaves_28),s(Time_29),buy(Situation_30))
| ~ at(City_27,Loaves_28,Time_29,Situation_30) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_32,plain,
! [Time_19,Situation_20] : ~ at(desMoines,s(none),Time_19,Situation_20),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_45,plain,
! [Time_29,Situation_30] : ~ at(desMoines,none,Time_29,Situation_30),
inference(resolution,[status(thm)],[c_40,c_32]) ).
tff(c_93,plain,
! [Time_42,Situation_43] : ~ at(omaha,none,Time_42,Situation_43),
inference(resolution,[status(thm)],[c_84,c_45]) ).
tff(c_178,plain,
! [Time_99,Situation_100] : ~ at(lincoln,none,Time_99,Situation_100),
inference(resolution,[status(thm)],[c_168,c_93]) ).
tff(c_217,plain,
! [Time_108,Situation_109] : ~ at(grandIsland,none,Time_108,Situation_109),
inference(resolution,[status(thm)],[c_206,c_178]) ).
tff(c_233,plain,
! [Time_110,Situation_111] : ~ at(northPlatte,none,Time_110,Situation_111),
inference(resolution,[status(thm)],[c_75,c_217]) ).
tff(c_247,plain,
! [Time_34,Situation_35] : ~ at(cheyenne,none,Time_34,Situation_35),
inference(resolution,[status(thm)],[c_73,c_233]) ).
tff(c_30,plain,
at(cheyenne,none,start,initial_situation),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_250,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_247,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PLA001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 18:15:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.22/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.22/1.80
% 3.22/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.22/1.84
% 3.22/1.84 Inference rules
% 3.22/1.84 ----------------------
% 3.22/1.84 #Ref : 0
% 3.22/1.84 #Sup : 45
% 3.22/1.84 #Fact : 0
% 3.22/1.84 #Define : 0
% 3.22/1.84 #Split : 0
% 3.22/1.84 #Chain : 0
% 3.22/1.84 #Close : 0
% 3.22/1.84
% 3.22/1.84 Ordering : KBO
% 3.22/1.84
% 3.22/1.84 Simplification rules
% 3.22/1.84 ----------------------
% 3.22/1.84 #Subsume : 16
% 3.22/1.84 #Demod : 0
% 3.22/1.84 #Tautology : 0
% 3.22/1.84 #SimpNegUnit : 1
% 3.22/1.84 #BackRed : 1
% 3.22/1.84
% 3.22/1.84 #Partial instantiations: 0
% 3.22/1.84 #Strategies tried : 1
% 3.22/1.84
% 3.22/1.84 Timing (in seconds)
% 3.22/1.84 ----------------------
% 3.22/1.84 Preprocessing : 0.43
% 3.22/1.84 Parsing : 0.24
% 3.22/1.84 CNF conversion : 0.03
% 3.22/1.84 Main loop : 0.33
% 3.22/1.84 Inferencing : 0.15
% 3.22/1.84 Reduction : 0.08
% 3.22/1.84 Demodulation : 0.05
% 3.22/1.84 BG Simplification : 0.01
% 3.22/1.84 Subsumption : 0.06
% 3.22/1.84 Abstraction : 0.01
% 3.22/1.84 MUC search : 0.00
% 3.22/1.84 Cooper : 0.00
% 3.22/1.84 Total : 0.82
% 3.22/1.84 Index Insertion : 0.00
% 3.22/1.84 Index Deletion : 0.00
% 3.22/1.84 Index Matching : 0.00
% 3.22/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------