TSTP Solution File: PLA006-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PLA006-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/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:35 EDT 2023
% Result : Unsatisfiable 3.29s 1.83s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 36 ( 13 unt; 16 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 21 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 18 (; 18 !; 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_178,axiom,
holds(empty,s0),
file(unknown,unknown) ).
tff(f_177,axiom,
holds(clear(c),s0),
file(unknown,unknown) ).
tff(f_168,axiom,
differ(c,table),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X,State] :
( holds(holding(X),do(pickup(X),State))
| ~ holds(empty,State)
| ~ holds(clear(X),State)
| ~ differ(X,table) ),
file(unknown,unknown) ).
tff(f_181,axiom,
! [State] : holds(clear(table),State),
file(unknown,unknown) ).
tff(f_108,axiom,
! [X,Y,State] :
( holds(on(X,Y),do(putdown(X,Y),State))
| ~ holds(holding(X),State)
| ~ holds(clear(Y),State) ),
file(unknown,unknown) ).
tff(f_186,axiom,
! [State] : ~ holds(on(c,table),State),
file(unknown,unknown) ).
tff(c_58,plain,
holds(empty,s0),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_56,plain,
holds(clear(c),s0),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_40,plain,
differ(c,table),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_4,plain,
! [X_4,State_5] :
( ~ differ(X_4,table)
| ~ holds(clear(X_4),State_5)
| ~ holds(empty,State_5)
| holds(holding(X_4),do(pickup(X_4),State_5)) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_60,plain,
! [State_36] : holds(clear(table),State_36),
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_153,plain,
! [Y_67,State_68,X_69] :
( ~ holds(clear(Y_67),State_68)
| ~ holds(holding(X_69),State_68)
| holds(on(X_69,Y_67),do(putdown(X_69,Y_67),State_68)) ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_62,plain,
! [State_37] : ~ holds(on(c,table),State_37),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_157,plain,
! [State_68] :
( ~ holds(clear(table),State_68)
| ~ holds(holding(c),State_68) ),
inference(resolution,[status(thm)],[c_153,c_62]) ).
tff(c_162,plain,
! [State_72] : ~ holds(holding(c),State_72),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_157]) ).
tff(c_166,plain,
! [State_5] :
( ~ differ(c,table)
| ~ holds(clear(c),State_5)
| ~ holds(empty,State_5) ),
inference(resolution,[status(thm)],[c_4,c_162]) ).
tff(c_170,plain,
! [State_73] :
( ~ holds(clear(c),State_73)
| ~ holds(empty,State_73) ),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_166]) ).
tff(c_185,plain,
~ holds(empty,s0),
inference(resolution,[status(thm)],[c_56,c_170]) ).
tff(c_192,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_185]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : PLA006-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.15 % 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.36 % Computer : n014.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:16:03 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.29/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.29/1.83
% 3.29/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.29/1.87
% 3.29/1.87 Inference rules
% 3.29/1.87 ----------------------
% 3.29/1.87 #Ref : 0
% 3.29/1.87 #Sup : 28
% 3.29/1.87 #Fact : 0
% 3.29/1.87 #Define : 0
% 3.29/1.87 #Split : 0
% 3.29/1.87 #Chain : 0
% 3.29/1.87 #Close : 0
% 3.29/1.87
% 3.29/1.87 Ordering : KBO
% 3.29/1.87
% 3.29/1.87 Simplification rules
% 3.29/1.87 ----------------------
% 3.29/1.87 #Subsume : 3
% 3.29/1.87 #Demod : 13
% 3.29/1.87 #Tautology : 10
% 3.29/1.87 #SimpNegUnit : 0
% 3.29/1.87 #BackRed : 0
% 3.29/1.87
% 3.29/1.87 #Partial instantiations: 0
% 3.29/1.87 #Strategies tried : 1
% 3.29/1.87
% 3.29/1.87 Timing (in seconds)
% 3.29/1.87 ----------------------
% 3.29/1.87 Preprocessing : 0.50
% 3.29/1.87 Parsing : 0.27
% 3.29/1.87 CNF conversion : 0.03
% 3.29/1.87 Main loop : 0.31
% 3.29/1.87 Inferencing : 0.13
% 3.29/1.87 Reduction : 0.09
% 3.29/1.87 Demodulation : 0.07
% 3.29/1.87 BG Simplification : 0.02
% 3.29/1.87 Subsumption : 0.06
% 3.29/1.87 Abstraction : 0.01
% 3.29/1.87 MUC search : 0.00
% 3.29/1.87 Cooper : 0.00
% 3.29/1.87 Total : 0.86
% 3.29/1.87 Index Insertion : 0.00
% 3.29/1.87 Index Deletion : 0.00
% 3.29/1.87 Index Matching : 0.00
% 3.29/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------