TSTP Solution File: LAT037-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT037-1 : TPTP v8.1.2. Released v2.4.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 : n031.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:46:16 EDT 2023
% Result : Unsatisfiable 16.12s 6.46s
% Output : CNFRefutation 16.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of formulae : 53 ( 46 unt; 7 typ; 0 def)
% Number of atoms : 46 ( 45 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 : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 50 (; 50 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > zz > yy > xx > n1 > n0
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(zz,type,
zz: $i ).
tff(yy,type,
yy: $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(n1,type,
n1: $i ).
tff(xx,type,
xx: $i ).
tff(n0,type,
n0: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(f_87,axiom,
yy != zz,
file(unknown,unknown) ).
tff(f_72,axiom,
! [X] : ( join(X,n0) = X ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X] : ( meet(X,X) = X ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] : ( meet(X,Y) = meet(Y,X) ),
file(unknown,unknown) ).
tff(f_60,axiom,
! [X,Y,Z] : ( meet(meet(X,Y),Z) = meet(X,meet(Y,Z)) ),
file(unknown,unknown) ).
tff(f_70,axiom,
! [X] : ( meet(X,n0) = n0 ),
file(unknown,unknown) ).
tff(f_85,axiom,
meet(xx,zz) = n0,
file(unknown,unknown) ).
tff(f_74,axiom,
! [X] : ( meet(X,n1) = X ),
file(unknown,unknown) ).
tff(f_82,axiom,
join(xx,yy) = n1,
file(unknown,unknown) ).
tff(f_58,axiom,
! [X,Y] : ( join(X,Y) = join(Y,X) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y,Z] : ( join(X,meet(Y,Z)) = meet(join(X,Y),join(X,Z)) ),
file(unknown,unknown) ).
tff(f_84,axiom,
meet(xx,yy) = n0,
file(unknown,unknown) ).
tff(f_83,axiom,
join(xx,zz) = n1,
file(unknown,unknown) ).
tff(c_40,plain,
zz != yy,
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_24,plain,
! [X_24] : ( join(X_24,n0) = X_24 ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_2,plain,
! [X_1] : ( meet(X_1,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_10,plain,
! [Y_8,X_7] : ( meet(Y_8,X_7) = meet(X_7,Y_8) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_728,plain,
! [X_51,Y_52,Z_53] : ( meet(meet(X_51,Y_52),Z_53) = meet(X_51,meet(Y_52,Z_53)) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_7258,plain,
! [Y_125,X_126,Y_127] : ( meet(Y_125,meet(X_126,Y_127)) = meet(X_126,meet(Y_127,Y_125)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_728]) ).
tff(c_7968,plain,
! [X_128,Y_129] : ( meet(X_128,meet(X_128,Y_129)) = meet(Y_129,X_128) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_7258]) ).
tff(c_22,plain,
! [X_23] : ( meet(X_23,n0) = n0 ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_348,plain,
! [Y_43,X_44] : ( meet(Y_43,X_44) = meet(X_44,Y_43) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_397,plain,
! [X_23] : ( meet(n0,X_23) = n0 ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_348]) ).
tff(c_38,plain,
meet(xx,zz) = n0,
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_812,plain,
! [Z_53] : ( meet(xx,meet(zz,Z_53)) = meet(n0,Z_53) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_728]) ).
tff(c_1698,plain,
! [Z_70] : ( meet(xx,meet(zz,Z_70)) = n0 ),
inference(demodulation,[status(thm),theory(equality)],[c_397,c_812]) ).
tff(c_1729,plain,
! [Y_8] : ( meet(xx,meet(Y_8,zz)) = n0 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_1698]) ).
tff(c_8032,plain,
meet(zz,xx) = n0,
inference(superposition,[status(thm),theory(equality)],[c_7968,c_1729]) ).
tff(c_26,plain,
! [X_25] : ( meet(X_25,n1) = X_25 ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_32,plain,
join(xx,yy) = n1,
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_12,plain,
! [Y_10,X_9] : ( join(Y_10,X_9) = join(X_9,Y_10) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_837,plain,
! [X_54,Y_55,Z_56] : ( meet(join(X_54,Y_55),join(X_54,Z_56)) = join(X_54,meet(Y_55,Z_56)) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_39906,plain,
! [Y_284,Y_285,X_286] : ( meet(join(Y_284,Y_285),join(X_286,Y_284)) = join(Y_284,meet(Y_285,X_286)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_837]) ).
tff(c_40480,plain,
! [Y_285] : ( meet(join(yy,Y_285),n1) = join(yy,meet(Y_285,xx)) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_39906]) ).
tff(c_40652,plain,
! [Y_287] : ( join(yy,meet(Y_287,xx)) = join(yy,Y_287) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_40480]) ).
tff(c_40808,plain,
join(yy,zz) = join(yy,n0),
inference(superposition,[status(thm),theory(equality)],[c_8032,c_40652]) ).
tff(c_40899,plain,
join(yy,zz) = yy,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_40808]) ).
tff(c_36,plain,
meet(xx,yy) = n0,
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_406,plain,
! [X_25] : ( meet(n1,X_25) = X_25 ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_348]) ).
tff(c_34,plain,
join(xx,zz) = n1,
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_44992,plain,
! [Y_301,X_302,Z_303] : ( meet(join(Y_301,X_302),join(X_302,Z_303)) = join(X_302,meet(Y_301,Z_303)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_837]) ).
tff(c_45643,plain,
! [Z_303] : ( meet(n1,join(zz,Z_303)) = join(zz,meet(xx,Z_303)) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_44992]) ).
tff(c_47493,plain,
! [Z_310] : ( join(zz,meet(xx,Z_310)) = join(zz,Z_310) ),
inference(demodulation,[status(thm),theory(equality)],[c_406,c_45643]) ).
tff(c_47749,plain,
join(zz,yy) = join(zz,n0),
inference(superposition,[status(thm),theory(equality)],[c_36,c_47493]) ).
tff(c_47827,plain,
zz = yy,
inference(demodulation,[status(thm),theory(equality)],[c_40899,c_12,c_24,c_47749]) ).
tff(c_47829,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_47827]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LAT037-1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/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.15/0.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 13:19:44 EDT 2023
% 0.15/0.37 % CPUTime :
% 16.12/6.46 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.12/6.46
% 16.12/6.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 16.30/6.49
% 16.30/6.49 Inference rules
% 16.30/6.49 ----------------------
% 16.30/6.49 #Ref : 0
% 16.30/6.49 #Sup : 11647
% 16.30/6.49 #Fact : 0
% 16.30/6.49 #Define : 0
% 16.30/6.49 #Split : 3
% 16.30/6.49 #Chain : 0
% 16.30/6.49 #Close : 0
% 16.30/6.49
% 16.30/6.49 Ordering : KBO
% 16.30/6.49
% 16.30/6.49 Simplification rules
% 16.30/6.49 ----------------------
% 16.30/6.49 #Subsume : 350
% 16.30/6.49 #Demod : 13820
% 16.30/6.49 #Tautology : 7892
% 16.30/6.49 #SimpNegUnit : 19
% 16.30/6.49 #BackRed : 0
% 16.30/6.49
% 16.30/6.49 #Partial instantiations: 0
% 16.30/6.49 #Strategies tried : 1
% 16.30/6.49
% 16.30/6.49 Timing (in seconds)
% 16.30/6.49 ----------------------
% 16.30/6.50 Preprocessing : 0.48
% 16.30/6.50 Parsing : 0.23
% 16.30/6.50 CNF conversion : 0.02
% 16.30/6.50 Main loop : 4.83
% 16.30/6.50 Inferencing : 0.90
% 16.30/6.50 Reduction : 2.97
% 16.30/6.50 Demodulation : 2.71
% 16.30/6.50 BG Simplification : 0.09
% 16.30/6.50 Subsumption : 0.67
% 16.30/6.50 Abstraction : 0.14
% 16.30/6.50 MUC search : 0.00
% 16.30/6.50 Cooper : 0.00
% 16.30/6.50 Total : 5.37
% 16.30/6.50 Index Insertion : 0.00
% 16.30/6.50 Index Deletion : 0.00
% 16.30/6.50 Index Matching : 0.00
% 16.30/6.50 BG Taut test : 0.00
%------------------------------------------------------------------------------