TSTP Solution File: LAT090-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT090-1 : TPTP v8.1.2. Released v2.6.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 : n027.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:20 EDT 2023
% Result : Unsatisfiable 3.55s 2.00s
% Output : CNFRefutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 23 unt; 3 typ; 0 def)
% Number of atoms : 23 ( 22 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 39 (; 39 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(f_32,axiom,
! [A,B,C] : ( join(join(meet(A,B),meet(C,A)),A) = A ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A,B,C] : ( meet(meet(join(A,B),join(C,A)),A) = A ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B] : ( join(meet(A,B),meet(A,join(A,B))) = A ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [A,B] : ( join(meet(A,B),meet(B,join(A,B))) = B ),
file(unknown,unknown) ).
tff(f_34,axiom,
join(a,a) != a,
file(unknown,unknown) ).
tff(c_10,plain,
! [A_10,B_11,C_12] : ( join(join(meet(A_10,B_11),meet(C_12,A_10)),A_10) = A_10 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_109,plain,
! [A_22,B_23,C_24] : ( meet(meet(join(A_22,B_23),join(C_24,A_22)),A_22) = A_22 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_143,plain,
! [A_10,B_23] : ( meet(meet(join(A_10,B_23),A_10),A_10) = A_10 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_109]) ).
tff(c_2,plain,
! [A_1,B_2] : ( join(meet(A_1,B_2),meet(A_1,join(A_1,B_2))) = A_1 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_182,plain,
! [A_27,B_28] : ( meet(meet(join(A_27,B_28),A_27),A_27) = A_27 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_109]) ).
tff(c_687,plain,
! [A_44,B_45] : ( meet(meet(A_44,meet(A_44,B_45)),meet(A_44,B_45)) = meet(A_44,B_45) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_182]) ).
tff(c_747,plain,
! [A_10,B_23] : ( meet(meet(meet(join(A_10,B_23),A_10),A_10),meet(meet(join(A_10,B_23),A_10),A_10)) = meet(meet(join(A_10,B_23),A_10),A_10) ),
inference(superposition,[status(thm),theory(equality)],[c_143,c_687]) ).
tff(c_780,plain,
! [A_46] : ( meet(A_46,A_46) = A_46 ),
inference(demodulation,[status(thm),theory(equality)],[c_143,c_143,c_143,c_747]) ).
tff(c_8,plain,
! [A_7,B_8,C_9] : ( meet(meet(join(A_7,B_8),join(C_9,A_7)),A_7) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_800,plain,
! [B_8] : ( meet(join(B_8,B_8),B_8) = B_8 ),
inference(superposition,[status(thm),theory(equality)],[c_780,c_8]) ).
tff(c_770,plain,
! [A_10] : ( meet(A_10,A_10) = A_10 ),
inference(demodulation,[status(thm),theory(equality)],[c_143,c_143,c_143,c_747]) ).
tff(c_121,plain,
! [A_22,B_11] : ( join(join(meet(A_22,B_11),A_22),A_22) = A_22 ),
inference(superposition,[status(thm),theory(equality)],[c_109,c_10]) ).
tff(c_996,plain,
! [A_52] : ( join(join(A_52,A_52),A_52) = A_52 ),
inference(superposition,[status(thm),theory(equality)],[c_780,c_121]) ).
tff(c_6,plain,
! [A_5,B_6] : ( join(meet(A_5,B_6),meet(B_6,join(A_5,B_6))) = B_6 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_1026,plain,
! [A_52] : ( join(meet(join(A_52,A_52),A_52),meet(A_52,A_52)) = A_52 ),
inference(superposition,[status(thm),theory(equality)],[c_996,c_6]) ).
tff(c_1038,plain,
! [A_52] : ( join(A_52,A_52) = A_52 ),
inference(demodulation,[status(thm),theory(equality)],[c_800,c_770,c_1026]) ).
tff(c_12,plain,
join(a,a) != a,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_1047,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1038,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT090-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/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 : n027.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 13:16:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.55/2.00 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.55/2.01
% 3.55/2.01 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.84/2.04
% 3.84/2.04 Inference rules
% 3.84/2.04 ----------------------
% 3.84/2.04 #Ref : 0
% 3.84/2.04 #Sup : 281
% 3.84/2.04 #Fact : 0
% 3.84/2.04 #Define : 0
% 3.84/2.04 #Split : 0
% 3.84/2.04 #Chain : 0
% 3.84/2.04 #Close : 0
% 3.84/2.04
% 3.84/2.04 Ordering : KBO
% 3.84/2.04
% 3.84/2.04 Simplification rules
% 3.84/2.04 ----------------------
% 3.84/2.04 #Subsume : 0
% 3.84/2.04 #Demod : 158
% 3.84/2.04 #Tautology : 109
% 3.84/2.04 #SimpNegUnit : 0
% 3.84/2.04 #BackRed : 6
% 3.84/2.04
% 3.84/2.04 #Partial instantiations: 0
% 3.84/2.04 #Strategies tried : 1
% 3.84/2.04
% 3.84/2.04 Timing (in seconds)
% 3.84/2.04 ----------------------
% 3.84/2.05 Preprocessing : 0.41
% 3.84/2.05 Parsing : 0.22
% 3.84/2.05 CNF conversion : 0.02
% 3.84/2.05 Main loop : 0.48
% 3.84/2.05 Inferencing : 0.19
% 3.84/2.05 Reduction : 0.15
% 3.84/2.05 Demodulation : 0.12
% 3.84/2.05 BG Simplification : 0.03
% 3.84/2.05 Subsumption : 0.08
% 3.84/2.05 Abstraction : 0.03
% 3.84/2.05 MUC search : 0.00
% 3.84/2.05 Cooper : 0.00
% 3.84/2.05 Total : 0.94
% 3.84/2.05 Index Insertion : 0.00
% 3.84/2.05 Index Deletion : 0.00
% 3.84/2.05 Index Matching : 0.00
% 3.84/2.05 BG Taut test : 0.00
%------------------------------------------------------------------------------