TSTP Solution File: LDA001-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LDA001-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/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 : n015.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:49:20 EDT 2023
% Result : Unsatisfiable 3.48s 1.97s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 32 unt; 5 typ; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > u > n3 > n2 > n1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(u,type,
u: $i ).
tff(n3,type,
n3: $i ).
tff(n1,type,
n1: $i ).
tff(n2,type,
n2: $i ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_25,axiom,
n2 = f(n1,n1),
file(unknown,unknown) ).
tff(f_24,axiom,
! [X,Y,Z] : ( f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)) ),
file(unknown,unknown) ).
tff(f_26,axiom,
n3 = f(n2,n1),
file(unknown,unknown) ).
tff(f_27,axiom,
u = f(n2,n2),
file(unknown,unknown) ).
tff(f_30,axiom,
f(f(n3,n2),u) != f(f(u,u),u),
file(unknown,unknown) ).
tff(c_4,plain,
f(n1,n1) = n2,
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_23,plain,
! [X_4,Y_5,Z_6] : ( f(f(X_4,Y_5),f(X_4,Z_6)) = f(X_4,f(Y_5,Z_6)) ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_50,plain,
! [Z_6] : ( f(n2,f(n1,Z_6)) = f(n1,f(n1,Z_6)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_23]) ).
tff(c_6,plain,
f(n2,n1) = n3,
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_44,plain,
! [Z_6] : ( f(n3,f(n2,Z_6)) = f(n2,f(n1,Z_6)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_23]) ).
tff(c_197,plain,
! [Z_6] : ( f(n3,f(n2,Z_6)) = f(n1,f(n1,Z_6)) ),
inference(demodulation,[status(thm),theory(equality)],[c_50,c_44]) ).
tff(c_8,plain,
f(n2,n2) = u,
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_62,plain,
! [Z_7] : ( f(n3,f(n2,Z_7)) = f(n2,f(n1,Z_7)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_23]) ).
tff(c_77,plain,
f(n2,f(n1,n1)) = f(n3,n3),
inference(superposition,[status(thm),theory(equality)],[c_6,c_62]) ).
tff(c_83,plain,
f(n3,n3) = u,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_4,c_77]) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( f(f(X_1,Y_2),f(X_1,Z_3)) = f(X_1,f(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_90,plain,
! [Y_2] : ( f(f(n3,Y_2),u) = f(n3,f(Y_2,n3)) ),
inference(superposition,[status(thm),theory(equality)],[c_83,c_2]) ).
tff(c_107,plain,
! [Y_8] : ( f(f(n1,Y_8),n2) = f(n1,f(Y_8,n1)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_23]) ).
tff(c_122,plain,
f(n1,f(n1,n1)) = f(n2,n2),
inference(superposition,[status(thm),theory(equality)],[c_4,c_107]) ).
tff(c_125,plain,
f(n1,n2) = u,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_8,c_122]) ).
tff(c_53,plain,
! [Y_5] : ( f(f(n1,Y_5),n2) = f(n1,f(Y_5,n1)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_23]) ).
tff(c_156,plain,
f(n1,f(n2,n1)) = f(u,n2),
inference(superposition,[status(thm),theory(equality)],[c_125,c_53]) ).
tff(c_165,plain,
f(u,n2) = f(n1,n3),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_156]) ).
tff(c_59,plain,
! [Y_5] : ( f(f(n2,Y_5),u) = f(n2,f(Y_5,n2)) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_23]) ).
tff(c_224,plain,
! [Y_11] : ( f(f(n2,Y_11),u) = f(n2,f(Y_11,n2)) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_23]) ).
tff(c_245,plain,
f(n2,f(n2,n2)) = f(u,u),
inference(superposition,[status(thm),theory(equality)],[c_8,c_224]) ).
tff(c_250,plain,
f(u,u) = f(n2,u),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_245]) ).
tff(c_10,plain,
f(f(u,u),u) != f(f(n3,n2),u),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_251,plain,
f(f(n3,n2),u) != f(f(n2,u),u),
inference(demodulation,[status(thm),theory(equality)],[c_250,c_10]) ).
tff(c_252,plain,
f(f(n3,n2),u) != f(n1,f(n1,n3)),
inference(demodulation,[status(thm),theory(equality)],[c_50,c_165,c_59,c_251]) ).
tff(c_657,plain,
f(n3,f(n2,n3)) != f(n1,f(n1,n3)),
inference(demodulation,[status(thm),theory(equality)],[c_90,c_252]) ).
tff(c_660,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_197,c_657]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LDA001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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.14/0.35 % Computer : n015.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:08:14 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.48/1.97 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.48/1.97
% 3.48/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.97/2.00
% 3.97/2.00 Inference rules
% 3.97/2.00 ----------------------
% 3.97/2.00 #Ref : 0
% 3.97/2.00 #Sup : 192
% 3.97/2.00 #Fact : 0
% 3.97/2.00 #Define : 0
% 3.97/2.00 #Split : 0
% 3.97/2.00 #Chain : 0
% 3.97/2.00 #Close : 0
% 3.97/2.00
% 3.97/2.00 Ordering : KBO
% 3.97/2.00
% 3.97/2.00 Simplification rules
% 3.97/2.00 ----------------------
% 3.97/2.00 #Subsume : 0
% 3.97/2.00 #Demod : 101
% 3.97/2.00 #Tautology : 62
% 3.97/2.00 #SimpNegUnit : 0
% 3.97/2.01 #BackRed : 6
% 3.97/2.01
% 3.97/2.01 #Partial instantiations: 0
% 3.97/2.01 #Strategies tried : 1
% 3.97/2.01
% 3.97/2.01 Timing (in seconds)
% 3.97/2.01 ----------------------
% 3.97/2.01 Preprocessing : 0.43
% 3.97/2.01 Parsing : 0.22
% 3.97/2.01 CNF conversion : 0.02
% 3.97/2.01 Main loop : 0.51
% 3.97/2.01 Inferencing : 0.20
% 3.97/2.01 Reduction : 0.17
% 3.97/2.01 Demodulation : 0.14
% 3.97/2.01 BG Simplification : 0.03
% 3.97/2.01 Subsumption : 0.09
% 3.97/2.01 Abstraction : 0.03
% 3.97/2.01 MUC search : 0.00
% 3.97/2.01 Cooper : 0.00
% 3.97/2.01 Total : 0.99
% 3.97/2.01 Index Insertion : 0.00
% 3.97/2.01 Index Deletion : 0.00
% 3.97/2.01 Index Matching : 0.00
% 3.97/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------