TSTP Solution File: LAT088-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT088-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 : n011.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:19 EDT 2023
% Result : Unsatisfiable 3.30s 1.87s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 17 ( 14 unt; 3 typ; 0 def)
% Number of atoms : 14 ( 13 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 : 25 (; 25 !; 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_34,axiom,
meet(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_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_12,plain,
meet(a,a) != a,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_782,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_770,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LAT088-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.15 % 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.17/0.37 % Computer : n011.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Thu Aug 3 12:45:06 EDT 2023
% 0.17/0.37 % CPUTime :
% 3.30/1.87 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.30/1.87
% 3.30/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.56/1.91
% 3.56/1.91 Inference rules
% 3.56/1.91 ----------------------
% 3.56/1.91 #Ref : 0
% 3.56/1.91 #Sup : 211
% 3.56/1.91 #Fact : 0
% 3.56/1.91 #Define : 0
% 3.56/1.91 #Split : 0
% 3.56/1.91 #Chain : 0
% 3.56/1.91 #Close : 0
% 3.56/1.91
% 3.56/1.91 Ordering : KBO
% 3.56/1.91
% 3.56/1.91 Simplification rules
% 3.56/1.91 ----------------------
% 3.56/1.91 #Subsume : 0
% 3.56/1.91 #Demod : 107
% 3.56/1.91 #Tautology : 72
% 3.56/1.91 #SimpNegUnit : 0
% 3.56/1.91 #BackRed : 5
% 3.56/1.91
% 3.56/1.91 #Partial instantiations: 0
% 3.56/1.91 #Strategies tried : 1
% 3.56/1.91
% 3.56/1.91 Timing (in seconds)
% 3.56/1.91 ----------------------
% 3.56/1.91 Preprocessing : 0.40
% 3.56/1.91 Parsing : 0.21
% 3.56/1.91 CNF conversion : 0.02
% 3.56/1.91 Main loop : 0.42
% 3.56/1.91 Inferencing : 0.16
% 3.56/1.91 Reduction : 0.13
% 3.56/1.91 Demodulation : 0.10
% 3.56/1.91 BG Simplification : 0.02
% 3.56/1.91 Subsumption : 0.08
% 3.56/1.91 Abstraction : 0.03
% 3.56/1.91 MUC search : 0.00
% 3.56/1.91 Cooper : 0.00
% 3.56/1.91 Total : 0.88
% 3.56/1.91 Index Insertion : 0.00
% 3.56/1.91 Index Deletion : 0.00
% 3.56/1.91 Index Matching : 0.00
% 3.56/1.91 BG Taut test : 0.00
%------------------------------------------------------------------------------