TSTP Solution File: CAT001-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT001-4 : 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/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 : n015.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 6.79s 3.14s
% Output : CNFRefutation 6.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 21 ( 8 unt; 9 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 : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equivalent > there_exists > 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(f_121,axiom,
h != g,
file(unknown,unknown) ).
tff(f_119,axiom,
compose(b,h) = compose(b,g),
file(unknown,unknown) ).
tff(f_102,axiom,
! [X,Y,Z] : ( compose(X,compose(Y,Z)) = compose(compose(X,Y),Z) ),
file(unknown,unknown) ).
tff(f_117,axiom,
! [X,Y,Z] :
( ( compose(compose(a,b),X) != Y )
| ( compose(compose(a,b),Z) != Y )
| ( X = Z ) ),
file(unknown,unknown) ).
tff(c_32,plain,
h != g,
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_30,plain,
compose(b,h) = compose(b,g),
inference(cnfTransformation,[status(thm)],[f_119]) ).
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_102]) ).
tff(c_26,plain,
! [Z_22,X_20] :
( ( Z_22 = X_20 )
| ( compose(compose(a,b),Z_22) != compose(compose(a,b),X_20) ) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_362,plain,
! [Z_42,X_43] :
( ( Z_42 = X_43 )
| ( compose(a,compose(b,Z_42)) != compose(a,compose(b,X_43)) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_18,c_26]) ).
tff(c_374,plain,
! [Z_42] :
( ( h = Z_42 )
| ( compose(a,compose(b,g)) != compose(a,compose(b,Z_42)) ) ),
inference(superposition,[status(thm),theory(equality)],[c_30,c_362]) ).
tff(c_5100,plain,
h = g,
inference(reflexivity,[status(thm),theory(equality)],[c_374]) ).
tff(c_5102,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32,c_5100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CAT001-4 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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.13/0.35 % Computer : n015.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 18:02:14 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.79/3.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.79/3.14
% 6.79/3.14 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.79/3.16
% 6.79/3.16 Inference rules
% 6.79/3.16 ----------------------
% 6.79/3.16 #Ref : 2
% 6.79/3.16 #Sup : 1274
% 6.79/3.16 #Fact : 0
% 6.79/3.16 #Define : 0
% 6.79/3.16 #Split : 0
% 6.79/3.16 #Chain : 0
% 6.79/3.16 #Close : 0
% 6.79/3.16
% 6.79/3.16 Ordering : KBO
% 6.79/3.16
% 6.79/3.16 Simplification rules
% 6.79/3.16 ----------------------
% 6.79/3.16 #Subsume : 222
% 6.79/3.16 #Demod : 1687
% 6.79/3.16 #Tautology : 677
% 6.79/3.16 #SimpNegUnit : 1
% 6.79/3.16 #BackRed : 10
% 6.79/3.16
% 6.79/3.16 #Partial instantiations: 0
% 6.79/3.16 #Strategies tried : 1
% 6.79/3.16
% 6.79/3.16 Timing (in seconds)
% 6.79/3.16 ----------------------
% 6.79/3.17 Preprocessing : 0.63
% 6.79/3.17 Parsing : 0.29
% 6.79/3.17 CNF conversion : 0.03
% 6.79/3.17 Main loop : 1.21
% 6.79/3.17 Inferencing : 0.43
% 6.79/3.17 Reduction : 0.45
% 6.79/3.17 Demodulation : 0.35
% 6.79/3.17 BG Simplification : 0.04
% 6.79/3.17 Subsumption : 0.22
% 6.79/3.17 Abstraction : 0.05
% 6.79/3.17 MUC search : 0.00
% 6.79/3.17 Cooper : 0.00
% 6.79/3.17 Total : 1.89
% 6.79/3.17 Index Insertion : 0.00
% 6.79/3.17 Index Deletion : 0.00
% 6.79/3.17 Index Matching : 0.00
% 6.79/3.17 BG Taut test : 0.00
%------------------------------------------------------------------------------