%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : PLA017-10 : TPTP v9.0.0. Released v7.3.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 : n018.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 : Wed Apr 9 08:23:03 PM UTC 2025
% Result : Unsatisfiable 63.61s 49.59s
% Output : CNFRefutation 63.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-4 aty)
% Number of variables : 31 ( 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ifeq > putdown > on > holds > do > differ > and > #nlpp > pickup > holding > clear > true > 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(clear,type,
clear: $i > $i ).
tff(d,type,
d: $i ).
tff(table,type,
table: $i ).
tff(true,type,
true: $i ).
tff(and,type,
and: ( $i * $i ) > $i ).
tff(holds,type,
holds: ( $i * $i ) > $i ).
tff(differ,type,
differ: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i ).
tff(do,type,
do: ( $i * $i ) > $i ).
tff(ifeq,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_69,axiom,
! [State] : ( holds(on(a,c),State) != true ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C] : ( ifeq(A,A,B,C) = B ),
file(unknown,unknown) ).
tff(f_48,axiom,
differ(a,c) = true,
file(unknown,unknown) ).
tff(f_46,axiom,
! [Y,X] : ( ifeq(differ(Y,X),true,differ(X,Y),true) = true ),
file(unknown,unknown) ).
tff(f_63,axiom,
holds(clear(c),s0) = true,
file(unknown,unknown) ).
tff(f_34,axiom,
! [X,Z,State] : ( ifeq(differ(X,Z),true,ifeq(holds(clear(X),State),true,holds(clear(X),do(pickup(Z),State)),true),true) = true ),
file(unknown,unknown) ).
tff(f_50,axiom,
differ(a,table) = true,
file(unknown,unknown) ).
tff(f_64,axiom,
holds(empty,s0) = true,
file(unknown,unknown) ).
tff(f_61,axiom,
holds(clear(a),s0) = true,
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,State] : ( ifeq(differ(X,table),true,ifeq(holds(empty,State),true,ifeq(holds(clear(X),State),true,holds(holding(X),do(pickup(X),State)),true),true),true) = true ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X,State,Y] : ( ifeq(holds(holding(X),State),true,ifeq(holds(clear(Y),State),true,holds(on(X,Y),do(putdown(X,Y),State)),true),true) = true ),
file(unknown,unknown) ).
tff(c_64,plain,
! [State_40] : ( holds(on(a,c),State_40) != true ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( ifeq(A_1,A_1,B_2,C_3) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_28,plain,
differ(a,c) = true,
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_154,plain,
! [Y_46,X_47] : ( ifeq(differ(Y_46,X_47),true,differ(X_47,Y_46),true) = true ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_191,plain,
ifeq(true,true,differ(c,a),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_28,c_154]) ).
tff(c_575,plain,
differ(c,a) = true,
inference(superposition,[status(thm),theory(equality)],[c_191,c_2]) ).
tff(c_58,plain,
holds(clear(c),s0) = true,
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_390,plain,
! [X_56,Z_57,State_58] : ( ifeq(differ(X_56,Z_57),true,ifeq(holds(clear(X_56),State_58),true,holds(clear(X_56),do(pickup(Z_57),State_58)),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_419,plain,
! [Z_57] : ( ifeq(differ(c,Z_57),true,ifeq(true,true,holds(clear(c),do(pickup(Z_57),s0)),true),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_58,c_390]) ).
tff(c_2541,plain,
! [Z_96] : ( ifeq(differ(c,Z_96),true,holds(clear(c),do(pickup(Z_96),s0)),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_419]) ).
tff(c_2551,plain,
ifeq(true,true,holds(clear(c),do(pickup(a),s0)),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_575,c_2541]) ).
tff(c_4605,plain,
holds(clear(c),do(pickup(a),s0)) = true,
inference(superposition,[status(thm),theory(equality)],[c_2551,c_2]) ).
tff(c_32,plain,
differ(a,table) = true,
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_60,plain,
holds(empty,s0) = true,
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_54,plain,
holds(clear(a),s0) = true,
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_893,plain,
! [X_77,State_78] : ( ifeq(differ(X_77,table),true,ifeq(holds(empty,State_78),true,ifeq(holds(clear(X_77),State_78),true,holds(holding(X_77),do(pickup(X_77),State_78)),true),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_903,plain,
ifeq(differ(a,table),true,ifeq(holds(empty,s0),true,ifeq(true,true,holds(holding(a),do(pickup(a),s0)),true),true),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_54,c_893]) ).
tff(c_928,plain,
holds(holding(a),do(pickup(a),s0)) = true,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_2,c_32,c_60,c_903]) ).
tff(c_16,plain,
! [X_22,State_23,Y_24] : ( ifeq(holds(holding(X_22),State_23),true,ifeq(holds(clear(Y_24),State_23),true,holds(on(X_22,Y_24),do(putdown(X_22,Y_24),State_23)),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_92970,plain,
! [Y_481] : ( ifeq(true,true,ifeq(holds(clear(Y_481),do(pickup(a),s0)),true,holds(on(a,Y_481),do(putdown(a,Y_481),do(pickup(a),s0))),true),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_928,c_16]) ).
tff(c_92983,plain,
ifeq(true,true,ifeq(true,true,holds(on(a,c),do(putdown(a,c),do(pickup(a),s0))),true),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_4605,c_92970]) ).
tff(c_92997,plain,
holds(on(a,c),do(putdown(a,c),do(pickup(a),s0))) = true,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_92983]) ).
tff(c_92999,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_64,c_92997]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PLA017-10 : TPTP v9.0.0. Released v7.3.0.
% 0.06/0.13 % 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.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 8 16:35:02 EDT 2025
% 0.12/0.34 % CPUTime :
% 63.61/49.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 63.61/49.60
% 63.61/49.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------