TSTP Solution File: CAT001-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT001-3 : TPTP v8.1.2. Released v1.0.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 : n010.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:34:34 EDT 2023
% Result : Unsatisfiable 12.20s 4.14s
% Output : CNFRefutation 12.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 22 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equivalent > there_exists > f1 > compose > #nlpp > domain > codomain > h > g > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(equivalent,type,
equivalent: ( $i * $i ) > $o ).
tff(h,type,
h: $i ).
tff(a,type,
a: $i ).
tff(domain,type,
domain: $i > $i ).
tff(there_exists,type,
there_exists: $i > $o ).
tff(b,type,
b: $i ).
tff(g,type,
g: $i ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f1,type,
f1: ( $i * $i ) > $i ).
tff(f_169,axiom,
h != g,
file(unknown,unknown) ).
tff(f_167,axiom,
compose(b,h) = compose(b,g),
file(unknown,unknown) ).
tff(f_101,axiom,
! [X,Y,Z] : ( compose(X,compose(Y,Z)) = compose(compose(X,Y),Z) ),
file(unknown,unknown) ).
tff(f_165,axiom,
! [X,Y,Z] :
( ( compose(compose(a,b),X) != Y )
| ( compose(compose(a,b),Z) != Y )
| ( X = Z ) ),
file(unknown,unknown) ).
tff(c_44,plain,
h != g,
inference(cnfTransformation,[status(thm)],[f_169]) ).
tff(c_42,plain,
compose(b,h) = compose(b,g),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_18,plain,
! [X_15,Y_16,Z_17] : ( compose(compose(X_15,Y_16),Z_17) = compose(X_15,compose(Y_16,Z_17)) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_38,plain,
! [Z_34,X_32] :
( ( Z_34 = X_32 )
| ( compose(compose(a,b),Z_34) != compose(compose(a,b),X_32) ) ),
inference(cnfTransformation,[status(thm)],[f_165]) ).
tff(c_542,plain,
! [Z_66,X_67] :
( ( Z_66 = X_67 )
| ( compose(a,compose(b,Z_66)) != compose(a,compose(b,X_67)) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_18,c_38]) ).
tff(c_554,plain,
! [Z_66] :
( ( h = Z_66 )
| ( compose(a,compose(b,g)) != compose(a,compose(b,Z_66)) ) ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_542]) ).
tff(c_38794,plain,
h = g,
inference(reflexivity,[status(thm),theory(equality)],[c_554]) ).
tff(c_38796,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_44,c_38794]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CAT001-3 : TPTP v8.1.2. Released v1.0.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 : n010.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 17:35:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 12.20/4.14 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.20/4.14
% 12.20/4.14 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.64/4.17
% 12.64/4.17 Inference rules
% 12.64/4.17 ----------------------
% 12.64/4.17 #Ref : 2
% 12.64/4.17 #Sup : 6313
% 12.64/4.17 #Fact : 16
% 12.64/4.17 #Define : 0
% 12.64/4.17 #Split : 0
% 12.64/4.17 #Chain : 0
% 12.64/4.17 #Close : 0
% 12.64/4.17
% 12.64/4.17 Ordering : KBO
% 12.64/4.17
% 12.64/4.17 Simplification rules
% 12.64/4.17 ----------------------
% 12.64/4.17 #Subsume : 2299
% 12.64/4.17 #Demod : 3604
% 12.64/4.17 #Tautology : 1836
% 12.64/4.17 #SimpNegUnit : 1
% 12.64/4.17 #BackRed : 11
% 12.64/4.17
% 12.64/4.17 #Partial instantiations: 7872
% 12.64/4.17 #Strategies tried : 1
% 12.64/4.17
% 12.64/4.17 Timing (in seconds)
% 12.64/4.17 ----------------------
% 12.64/4.17 Preprocessing : 0.58
% 12.64/4.17 Parsing : 0.26
% 12.64/4.17 CNF conversion : 0.03
% 12.64/4.17 Main loop : 2.54
% 12.64/4.17 Inferencing : 0.80
% 12.64/4.17 Reduction : 0.87
% 12.64/4.17 Demodulation : 0.71
% 12.64/4.17 BG Simplification : 0.08
% 12.64/4.17 Subsumption : 0.67
% 12.64/4.17 Abstraction : 0.09
% 12.64/4.17 MUC search : 0.00
% 12.64/4.17 Cooper : 0.00
% 12.64/4.17 Total : 3.17
% 12.64/4.17 Index Insertion : 0.00
% 12.64/4.17 Index Deletion : 0.00
% 12.64/4.17 Index Matching : 0.00
% 12.64/4.17 BG Taut test : 0.00
%------------------------------------------------------------------------------