TSTP Solution File: CAT003-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT003-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:35 EDT 2023
% Result : Unsatisfiable 9.56s 3.34s
% Output : CNFRefutation 9.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 23 ( 11 unt; 9 typ; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 4 |; 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 : 17 (; 17 !; 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_120,axiom,
g != h,
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_118,axiom,
compose(h,a) = compose(g,a),
file(unknown,unknown) ).
tff(f_116,axiom,
! [X,Y,Z] :
( ( compose(X,compose(a,b)) != Y )
| ( compose(Z,compose(a,b)) != Y )
| ( X = Z ) ),
file(unknown,unknown) ).
tff(c_32,plain,
h != g,
inference(cnfTransformation,[status(thm)],[f_120]) ).
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_30,plain,
compose(h,a) = compose(g,a),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_127,plain,
! [X_37,Y_38,Z_39] : ( compose(compose(X_37,Y_38),Z_39) = compose(X_37,compose(Y_38,Z_39)) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_152,plain,
! [Z_39] : ( compose(compose(g,a),Z_39) = compose(h,compose(a,Z_39)) ),
inference(superposition,[status(thm),theory(equality)],[c_30,c_127]) ).
tff(c_1015,plain,
! [Z_63] : ( compose(h,compose(a,Z_63)) = compose(g,compose(a,Z_63)) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_152]) ).
tff(c_26,plain,
! [Z_22,X_20] :
( ( Z_22 = X_20 )
| ( compose(Z_22,compose(a,b)) != compose(X_20,compose(a,b)) ) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_1027,plain,
! [X_20] :
( ( h = X_20 )
| ( compose(g,compose(a,b)) != compose(X_20,compose(a,b)) ) ),
inference(superposition,[status(thm),theory(equality)],[c_1015,c_26]) ).
tff(c_15291,plain,
h = g,
inference(reflexivity,[status(thm),theory(equality)],[c_1027]) ).
tff(c_15293,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32,c_15291]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT003-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 18:07:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 9.56/3.34 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.86/3.35
% 9.86/3.35 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.86/3.37
% 9.86/3.37 Inference rules
% 9.86/3.37 ----------------------
% 9.86/3.37 #Ref : 2
% 9.86/3.37 #Sup : 4013
% 9.86/3.37 #Fact : 0
% 9.86/3.37 #Define : 0
% 9.86/3.37 #Split : 6
% 9.86/3.37 #Chain : 0
% 9.86/3.37 #Close : 0
% 9.86/3.37
% 9.86/3.37 Ordering : KBO
% 9.86/3.37
% 9.86/3.37 Simplification rules
% 9.86/3.37 ----------------------
% 9.86/3.37 #Subsume : 1014
% 9.86/3.37 #Demod : 4325
% 9.86/3.37 #Tautology : 1465
% 9.86/3.37 #SimpNegUnit : 11
% 9.86/3.37 #BackRed : 18
% 9.86/3.37
% 9.86/3.37 #Partial instantiations: 0
% 9.86/3.37 #Strategies tried : 1
% 9.86/3.37
% 9.86/3.37 Timing (in seconds)
% 9.86/3.37 ----------------------
% 9.86/3.37 Preprocessing : 0.47
% 9.86/3.37 Parsing : 0.23
% 9.86/3.37 CNF conversion : 0.03
% 9.86/3.37 Main loop : 1.86
% 9.86/3.37 Inferencing : 0.59
% 9.86/3.37 Reduction : 0.71
% 9.86/3.37 Demodulation : 0.56
% 9.86/3.37 BG Simplification : 0.06
% 9.86/3.37 Subsumption : 0.39
% 9.86/3.37 Abstraction : 0.07
% 9.86/3.37 MUC search : 0.00
% 9.86/3.37 Cooper : 0.00
% 9.86/3.37 Total : 2.38
% 9.86/3.38 Index Insertion : 0.00
% 9.86/3.38 Index Deletion : 0.00
% 9.86/3.38 Index Matching : 0.00
% 9.86/3.38 BG Taut test : 0.00
%------------------------------------------------------------------------------