TSTP Solution File: LAT012-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT012-1 : TPTP v8.1.2. Released v2.2.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 : 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:46:14 EDT 2023
% Result : Unsatisfiable 20.34s 8.94s
% Output : CNFRefutation 20.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 25 unt; 4 typ; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 53 (; 53 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(f_34,axiom,
! [X,Y,Z] : ( meet(meet(join(X,Y),join(Y,Z)),Y) = Y ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,Y,Z] : ( join(X,meet(Y,meet(X,Z))) = X ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,Y,Z] : ( meet(X,join(Y,join(X,Z))) = X ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y,Z] : ( join(join(meet(X,Y),meet(Y,Z)),Y) = Y ),
file(unknown,unknown) ).
tff(f_37,axiom,
meet(b,a) != meet(a,b),
file(unknown,unknown) ).
tff(c_72,plain,
! [X_23,Y_24,Z_25] : ( meet(meet(join(X_23,Y_24),join(Y_24,Z_25)),Y_24) = Y_24 ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( join(X_1,meet(Y_2,meet(X_1,Z_3))) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_85,plain,
! [X_1,Z_3] : ( join(X_1,meet(X_1,Z_3)) = X_1 ),
inference(superposition,[status(thm),theory(equality)],[c_72,c_2]) ).
tff(c_20,plain,
! [X_16,Y_17,Z_18] : ( meet(X_16,join(Y_17,join(X_16,Z_18))) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_32,plain,
! [X_1,Y_17] : ( meet(X_1,join(Y_17,X_1)) = X_1 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_20]) ).
tff(c_220,plain,
! [X_30,Y_31,Z_32] : ( join(join(meet(X_30,Y_31),meet(Y_31,Z_32)),Y_31) = Y_31 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_333,plain,
! [X_35,Y_36] : ( join(meet(X_35,Y_36),Y_36) = Y_36 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_220]) ).
tff(c_849,plain,
! [X_49,Y_50] : ( join(X_49,join(Y_50,X_49)) = join(Y_50,X_49) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_333]) ).
tff(c_900,plain,
! [X_1,Z_3] : ( join(meet(X_1,Z_3),X_1) = join(X_1,meet(X_1,Z_3)) ),
inference(superposition,[status(thm),theory(equality)],[c_85,c_849]) ).
tff(c_923,plain,
! [X_1,Z_3] : ( join(meet(X_1,Z_3),X_1) = X_1 ),
inference(demodulation,[status(thm),theory(equality)],[c_85,c_900]) ).
tff(c_26,plain,
! [X_16,Y_2] : ( join(X_16,meet(Y_2,X_16)) = X_16 ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_2]) ).
tff(c_72746,plain,
! [X_412,Y_413,Z_414] : ( meet(meet(X_412,join(meet(Y_413,X_412),Z_414)),meet(Y_413,X_412)) = meet(Y_413,X_412) ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_72]) ).
tff(c_73646,plain,
! [Z_3,X_1] : ( meet(meet(Z_3,X_1),meet(X_1,Z_3)) = meet(X_1,Z_3) ),
inference(superposition,[status(thm),theory(equality)],[c_923,c_72746]) ).
tff(c_74005,plain,
! [Z_415,X_416] : ( meet(meet(Z_415,X_416),meet(X_416,Z_415)) = meet(X_416,Z_415) ),
inference(superposition,[status(thm),theory(equality)],[c_923,c_72746]) ).
tff(c_163,plain,
! [X_28,Z_29] : ( join(X_28,meet(X_28,Z_29)) = X_28 ),
inference(superposition,[status(thm),theory(equality)],[c_72,c_2]) ).
tff(c_175,plain,
! [X_28,Z_29] : ( meet(meet(X_28,Z_29),X_28) = meet(X_28,Z_29) ),
inference(superposition,[status(thm),theory(equality)],[c_163,c_32]) ).
tff(c_74404,plain,
! [Z_415,X_416] : ( meet(meet(Z_415,X_416),meet(X_416,Z_415)) = meet(meet(X_416,Z_415),meet(Z_415,X_416)) ),
inference(superposition,[status(thm),theory(equality)],[c_74005,c_175]) ).
tff(c_74921,plain,
! [Z_415,X_416] : ( meet(Z_415,X_416) = meet(X_416,Z_415) ),
inference(demodulation,[status(thm),theory(equality)],[c_73646,c_73646,c_74404]) ).
tff(c_10,plain,
meet(b,a) != meet(a,b),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_75060,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_74921,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LAT012-1 : TPTP v8.1.2. Released v2.2.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.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 12:51:58 EDT 2023
% 0.15/0.36 % CPUTime :
% 20.34/8.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.34/8.95
% 20.34/8.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 20.54/8.98
% 20.54/8.98 Inference rules
% 20.54/8.98 ----------------------
% 20.54/8.98 #Ref : 0
% 20.54/8.98 #Sup : 18602
% 20.54/8.98 #Fact : 0
% 20.54/8.98 #Define : 0
% 20.54/8.98 #Split : 0
% 20.54/8.98 #Chain : 0
% 20.54/8.98 #Close : 0
% 20.54/8.98
% 20.54/8.98 Ordering : KBO
% 20.54/8.98
% 20.54/8.98 Simplification rules
% 20.54/8.98 ----------------------
% 20.54/8.98 #Subsume : 84
% 20.54/8.98 #Demod : 20952
% 20.54/8.98 #Tautology : 12435
% 20.54/8.98 #SimpNegUnit : 0
% 20.54/8.98 #BackRed : 5
% 20.54/8.98
% 20.54/8.98 #Partial instantiations: 0
% 20.54/8.98 #Strategies tried : 1
% 20.54/8.98
% 20.54/8.98 Timing (in seconds)
% 20.54/8.98 ----------------------
% 20.54/8.98 Preprocessing : 0.41
% 20.54/8.98 Parsing : 0.21
% 20.54/8.98 CNF conversion : 0.02
% 20.54/8.98 Main loop : 7.43
% 20.54/8.98 Inferencing : 1.88
% 20.54/8.98 Reduction : 4.13
% 20.54/8.98 Demodulation : 3.81
% 20.54/8.98 BG Simplification : 0.18
% 20.54/8.98 Subsumption : 0.96
% 20.54/8.98 Abstraction : 0.51
% 20.54/8.98 MUC search : 0.00
% 20.54/8.98 Cooper : 0.00
% 20.54/8.98 Total : 7.89
% 20.54/8.98 Index Insertion : 0.00
% 20.54/8.98 Index Deletion : 0.00
% 20.54/8.98 Index Matching : 0.00
% 20.54/8.98 BG Taut test : 0.00
%------------------------------------------------------------------------------