TSTP Solution File: PLA020-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PLA020-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %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 : Tue Aug 22 10:53:38 EDT 2023
% Result : Unsatisfiable 3.55s 1.88s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 21
% Syntax : Number of formulae : 29 ( 9 unt; 16 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 9 >; 6 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ holds > differ > putdown > on > do > and > #nlpp > pickup > holding > clear > table > s0 > empty > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(s0,type,
s0: $i ).
tff(a,type,
a: $i ).
tff(putdown,type,
putdown: ( $i * $i ) > $i ).
tff(pickup,type,
pickup: $i > $i ).
tff(b,type,
b: $i ).
tff(on,type,
on: ( $i * $i ) > $i ).
tff(holding,type,
holding: $i > $i ).
tff(holds,type,
holds: ( $i * $i ) > $o ).
tff(clear,type,
clear: $i > $i ).
tff(d,type,
d: $i ).
tff(table,type,
table: $i ).
tff(and,type,
and: ( $i * $i ) > $i ).
tff(differ,type,
differ: ( $i * $i ) > $o ).
tff(empty,type,
empty: $i ).
tff(do,type,
do: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_177,axiom,
holds(clear(c),s0),
file(unknown,unknown) ).
tff(f_178,axiom,
holds(empty,s0),
file(unknown,unknown) ).
tff(f_173,axiom,
holds(on(c,d),s0),
file(unknown,unknown) ).
tff(f_76,axiom,
! [Y,X,State] :
( holds(clear(Y),do(pickup(X),State))
| ~ holds(on(X,Y),State)
| ~ holds(clear(X),State)
| ~ holds(empty,State) ),
file(unknown,unknown) ).
tff(f_186,axiom,
! [State] : ~ holds(clear(d),State),
file(unknown,unknown) ).
tff(c_56,plain,
holds(clear(c),s0),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_58,plain,
holds(empty,s0),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_48,plain,
holds(on(c,d),s0),
inference(cnfTransformation,[status(thm)],[f_173]) ).
tff(c_190,plain,
! [State_75,X_76,Y_77] :
( ~ holds(empty,State_75)
| ~ holds(clear(X_76),State_75)
| ~ holds(on(X_76,Y_77),State_75)
| holds(clear(Y_77),do(pickup(X_76),State_75)) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_62,plain,
! [State_37] : ~ holds(clear(d),State_37),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_196,plain,
! [State_78,X_79] :
( ~ holds(empty,State_78)
| ~ holds(clear(X_79),State_78)
| ~ holds(on(X_79,d),State_78) ),
inference(resolution,[status(thm)],[c_190,c_62]) ).
tff(c_211,plain,
( ~ holds(empty,s0)
| ~ holds(clear(c),s0) ),
inference(resolution,[status(thm)],[c_48,c_196]) ).
tff(c_218,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_58,c_211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : PLA020-1 : TPTP v8.1.2. Released v1.1.0.
% 0.14/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.21/0.37 % WCLimit : 300
% 0.21/0.37 % DateTime : Thu Aug 3 18:08:39 EDT 2023
% 0.21/0.37 % CPUTime :
% 3.55/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.55/1.88
% 3.55/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.64/1.91
% 3.64/1.91 Inference rules
% 3.64/1.91 ----------------------
% 3.64/1.91 #Ref : 0
% 3.64/1.91 #Sup : 36
% 3.64/1.91 #Fact : 0
% 3.64/1.91 #Define : 0
% 3.64/1.91 #Split : 0
% 3.64/1.91 #Chain : 0
% 3.64/1.91 #Close : 0
% 3.64/1.91
% 3.64/1.91 Ordering : KBO
% 3.64/1.91
% 3.64/1.91 Simplification rules
% 3.64/1.91 ----------------------
% 3.64/1.91 #Subsume : 11
% 3.64/1.91 #Demod : 13
% 3.64/1.91 #Tautology : 10
% 3.64/1.91 #SimpNegUnit : 0
% 3.64/1.91 #BackRed : 0
% 3.64/1.91
% 3.64/1.91 #Partial instantiations: 0
% 3.64/1.91 #Strategies tried : 1
% 3.64/1.91
% 3.64/1.91 Timing (in seconds)
% 3.64/1.91 ----------------------
% 3.64/1.91 Preprocessing : 0.50
% 3.64/1.91 Parsing : 0.28
% 3.64/1.91 CNF conversion : 0.03
% 3.64/1.91 Main loop : 0.33
% 3.64/1.91 Inferencing : 0.14
% 3.64/1.91 Reduction : 0.09
% 3.64/1.91 Demodulation : 0.07
% 3.64/1.91 BG Simplification : 0.02
% 3.64/1.91 Subsumption : 0.06
% 3.64/1.91 Abstraction : 0.01
% 3.64/1.91 MUC search : 0.00
% 3.64/1.91 Cooper : 0.00
% 3.64/1.91 Total : 0.88
% 3.64/1.91 Index Insertion : 0.00
% 3.64/1.91 Index Deletion : 0.00
% 3.64/1.91 Index Matching : 0.00
% 3.64/1.91 BG Taut test : 0.00
%------------------------------------------------------------------------------