TSTP Solution File: PLA017-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PLA017-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 : n012.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:37 EDT 2023
% Result : Unsatisfiable 3.67s 1.88s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 26
% Syntax : Number of formulae : 44 ( 14 unt; 16 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 64 ( 36 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 27 (; 27 !; 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_175,axiom,
holds(clear(a),s0),
file(unknown,unknown) ).
tff(f_177,axiom,
holds(clear(c),s0),
file(unknown,unknown) ).
tff(f_161,axiom,
differ(a,c),
file(unknown,unknown) ).
tff(f_159,axiom,
! [X,Y] :
( differ(X,Y)
| ~ differ(Y,X) ),
file(unknown,unknown) ).
tff(f_92,axiom,
! [X,Z,State] :
( holds(clear(X),do(pickup(Z),State))
| ~ holds(clear(X),State)
| ~ differ(X,Z) ),
file(unknown,unknown) ).
tff(f_163,axiom,
differ(a,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_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(a,c),State),
file(unknown,unknown) ).
tff(c_58,plain,
holds(empty,s0),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_52,plain,
holds(clear(a),s0),
inference(cnfTransformation,[status(thm)],[f_175]) ).
tff(c_56,plain,
holds(clear(c),s0),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_26,plain,
differ(a,c),
inference(cnfTransformation,[status(thm)],[f_161]) ).
tff(c_65,plain,
! [Y_40,X_41] :
( ~ differ(Y_40,X_41)
| differ(X_41,Y_40) ),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_91,plain,
differ(c,a),
inference(resolution,[status(thm)],[c_26,c_65]) ).
tff(c_10,plain,
! [X_13,Z_14,State_15] :
( ~ differ(X_13,Z_14)
| ~ holds(clear(X_13),State_15)
| holds(clear(X_13),do(pickup(Z_14),State_15)) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_30,plain,
differ(a,table),
inference(cnfTransformation,[status(thm)],[f_163]) ).
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_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(a,c),State_37),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_160,plain,
! [State_72] :
( ~ holds(clear(c),State_72)
| ~ holds(holding(a),State_72) ),
inference(resolution,[status(thm)],[c_153,c_62]) ).
tff(c_164,plain,
! [State_5] :
( ~ holds(clear(c),do(pickup(a),State_5))
| ~ differ(a,table)
| ~ holds(clear(a),State_5)
| ~ holds(empty,State_5) ),
inference(resolution,[status(thm)],[c_4,c_160]) ).
tff(c_168,plain,
! [State_73] :
( ~ holds(clear(c),do(pickup(a),State_73))
| ~ holds(clear(a),State_73)
| ~ holds(empty,State_73) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_164]) ).
tff(c_172,plain,
! [State_15] :
( ~ holds(clear(a),State_15)
| ~ holds(empty,State_15)
| ~ differ(c,a)
| ~ holds(clear(c),State_15) ),
inference(resolution,[status(thm)],[c_10,c_168]) ).
tff(c_176,plain,
! [State_74] :
( ~ holds(clear(a),State_74)
| ~ holds(empty,State_74)
| ~ holds(clear(c),State_74) ),
inference(demodulation,[status(thm),theory(equality)],[c_91,c_172]) ).
tff(c_191,plain,
( ~ holds(clear(a),s0)
| ~ holds(empty,s0) ),
inference(resolution,[status(thm)],[c_56,c_176]) ).
tff(c_198,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_52,c_191]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : PLA017-1 : TPTP v8.1.2. Released v1.1.0.
% 0.14/0.14 % 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.35 % Computer : n012.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:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.67/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.67/1.88
% 3.67/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.87/1.91
% 3.87/1.91 Inference rules
% 3.87/1.91 ----------------------
% 3.87/1.91 #Ref : 0
% 3.87/1.91 #Sup : 29
% 3.87/1.91 #Fact : 0
% 3.87/1.91 #Define : 0
% 3.87/1.91 #Split : 0
% 3.87/1.91 #Chain : 0
% 3.87/1.91 #Close : 0
% 3.87/1.91
% 3.87/1.91 Ordering : KBO
% 3.87/1.91
% 3.87/1.91 Simplification rules
% 3.87/1.91 ----------------------
% 3.87/1.91 #Subsume : 2
% 3.87/1.91 #Demod : 14
% 3.87/1.91 #Tautology : 10
% 3.87/1.91 #SimpNegUnit : 0
% 3.87/1.91 #BackRed : 0
% 3.87/1.91
% 3.87/1.91 #Partial instantiations: 0
% 3.87/1.91 #Strategies tried : 1
% 3.87/1.91
% 3.87/1.91 Timing (in seconds)
% 3.87/1.91 ----------------------
% 3.87/1.91 Preprocessing : 0.50
% 3.87/1.91 Parsing : 0.29
% 3.87/1.91 CNF conversion : 0.03
% 3.87/1.91 Main loop : 0.33
% 3.87/1.91 Inferencing : 0.14
% 3.87/1.91 Reduction : 0.10
% 3.87/1.91 Demodulation : 0.07
% 3.87/1.91 BG Simplification : 0.02
% 3.87/1.92 Subsumption : 0.06
% 3.87/1.92 Abstraction : 0.01
% 3.87/1.92 MUC search : 0.00
% 3.87/1.92 Cooper : 0.00
% 3.87/1.92 Total : 0.88
% 3.87/1.92 Index Insertion : 0.00
% 3.87/1.92 Index Deletion : 0.00
% 3.87/1.92 Index Matching : 0.00
% 3.87/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------