TSTP Solution File: LAT034-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT034-1 : TPTP v8.1.2. Bugfixed v2.5.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 : n017.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:15 EDT 2023
% Result : Unsatisfiable 2.64s 1.63s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 11 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > xx
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(join,type,
join: ( $i * $i ) > $i ).
tff(xx,type,
xx: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(f_30,axiom,
! [X,Y] : ( join(X,meet(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,Y] : ( meet(X,join(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_40,axiom,
meet(xx,xx) != xx,
file(unknown,unknown) ).
tff(c_96,plain,
! [X_21,Y_22] : ( join(X_21,meet(X_21,Y_22)) = X_21 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_2,plain,
! [X_1,Y_2] : ( meet(X_1,join(X_1,Y_2)) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_102,plain,
! [X_21] : ( meet(X_21,X_21) = X_21 ),
inference(superposition,[status(thm),theory(equality)],[c_96,c_2]) ).
tff(c_14,plain,
meet(xx,xx) != xx,
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_170,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_102,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT034-1 : TPTP v8.1.2. Bugfixed v2.5.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.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 12:18:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.64/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.64
% 2.64/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.64/1.67
% 2.64/1.67 Inference rules
% 2.64/1.67 ----------------------
% 2.64/1.67 #Ref : 0
% 2.64/1.67 #Sup : 40
% 2.64/1.67 #Fact : 0
% 2.64/1.67 #Define : 0
% 2.64/1.67 #Split : 0
% 2.64/1.67 #Chain : 0
% 2.64/1.67 #Close : 0
% 2.64/1.67
% 2.64/1.67 Ordering : KBO
% 2.64/1.67
% 2.64/1.67 Simplification rules
% 2.64/1.67 ----------------------
% 2.64/1.67 #Subsume : 0
% 2.64/1.67 #Demod : 7
% 2.64/1.67 #Tautology : 24
% 2.64/1.67 #SimpNegUnit : 0
% 2.64/1.67 #BackRed : 1
% 2.64/1.67
% 2.64/1.67 #Partial instantiations: 0
% 2.64/1.67 #Strategies tried : 1
% 2.64/1.67
% 2.64/1.67 Timing (in seconds)
% 2.64/1.67 ----------------------
% 2.64/1.67 Preprocessing : 0.39
% 2.64/1.67 Parsing : 0.21
% 2.64/1.67 CNF conversion : 0.02
% 2.64/1.67 Main loop : 0.22
% 2.64/1.67 Inferencing : 0.08
% 2.64/1.67 Reduction : 0.07
% 2.64/1.67 Demodulation : 0.06
% 2.64/1.67 BG Simplification : 0.01
% 2.64/1.67 Subsumption : 0.04
% 2.64/1.67 Abstraction : 0.01
% 2.64/1.67 MUC search : 0.00
% 2.64/1.67 Cooper : 0.00
% 2.64/1.67 Total : 0.66
% 2.64/1.67 Index Insertion : 0.00
% 2.64/1.67 Index Deletion : 0.00
% 2.64/1.67 Index Matching : 0.00
% 2.64/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------