TSTP Solution File: LAT035-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT035-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 : n016.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 2.76s 1.68s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 9 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > k > f > n1 > n0 > bb > aa
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bb,type,
bb: $i ).
tff(f,type,
f: $i > $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(n1,type,
n1: $i ).
tff(n0,type,
n0: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(k,type,
k: $i > $i ).
tff(aa,type,
aa: $i ).
tff(f_81,axiom,
! [U,V] : ( k(join(U,V)) = meet(k(U),k(V)) ),
file(unknown,unknown) ).
tff(f_88,axiom,
f(n1) = n0,
file(unknown,unknown) ).
tff(f_84,axiom,
k(n0) = n1,
file(unknown,unknown) ).
tff(f_87,axiom,
! [U,V] : ( f(meet(U,V)) = join(f(U),f(V)) ),
file(unknown,unknown) ).
tff(f_93,axiom,
( ( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb))) )
| ( f(k(n0)) != n0 ) ),
file(unknown,unknown) ).
tff(c_28,plain,
! [U_24,V_25] : ( meet(k(U_24),k(V_25)) = k(join(U_24,V_25)) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_38,plain,
f(n1) = n0,
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_32,plain,
k(n0) = n1,
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_36,plain,
! [U_28,V_29] : ( join(f(U_28),f(V_29)) = f(meet(U_28,V_29)) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_40,plain,
( ( f(k(n0)) != n0 )
| ( join(f(k(aa)),f(k(bb))) != f(k(join(aa,bb))) ) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_41,plain,
( ( f(k(n0)) != n0 )
| ( f(meet(k(aa),k(bb))) != f(k(join(aa,bb))) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_40]) ).
tff(c_42,plain,
( ( f(n1) != n0 )
| ( f(meet(k(aa),k(bb))) != f(k(join(aa,bb))) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_41]) ).
tff(c_44,plain,
f(meet(k(aa),k(bb))) != f(k(join(aa,bb))),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_42]) ).
tff(c_46,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT035-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % 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 : n016.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 13:10:37 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.76/1.68 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.76/1.68
% 2.76/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.83/1.70
% 2.83/1.70 Inference rules
% 2.83/1.70 ----------------------
% 2.83/1.70 #Ref : 0
% 2.83/1.70 #Sup : 0
% 2.83/1.71 #Fact : 0
% 2.83/1.71 #Define : 0
% 2.83/1.71 #Split : 0
% 2.83/1.71 #Chain : 0
% 2.83/1.71 #Close : 0
% 2.83/1.71
% 2.83/1.71 Ordering : KBO
% 2.83/1.71
% 2.83/1.71 Simplification rules
% 2.83/1.71 ----------------------
% 2.83/1.71 #Subsume : 19
% 2.83/1.71 #Demod : 4
% 2.83/1.71 #Tautology : 0
% 2.83/1.71 #SimpNegUnit : 0
% 2.83/1.71 #BackRed : 0
% 2.83/1.71
% 2.83/1.71 #Partial instantiations: 0
% 2.83/1.71 #Strategies tried : 1
% 2.83/1.71
% 2.83/1.71 Timing (in seconds)
% 2.83/1.71 ----------------------
% 2.83/1.71 Preprocessing : 0.55
% 2.83/1.71 Parsing : 0.24
% 2.83/1.71 CNF conversion : 0.03
% 2.83/1.71 Main loop : 0.06
% 2.83/1.71 Inferencing : 0.00
% 2.83/1.71 Reduction : 0.03
% 2.83/1.71 Demodulation : 0.02
% 2.83/1.71 BG Simplification : 0.01
% 2.83/1.71 Subsumption : 0.02
% 2.83/1.71 Abstraction : 0.01
% 2.83/1.71 MUC search : 0.00
% 2.83/1.71 Cooper : 0.00
% 2.83/1.71 Total : 0.65
% 2.83/1.71 Index Insertion : 0.00
% 2.83/1.71 Index Deletion : 0.00
% 2.83/1.71 Index Matching : 0.00
% 2.83/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------