TSTP Solution File: CAT006-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT006-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/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 : n026.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:36 EDT 2023
% Result : Unsatisfiable 2.92s 1.79s
% Output : CNFRefutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 33 ( 13 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equivalent > there_exists > compose > #nlpp > domain > codomain > d > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(equivalent,type,
equivalent: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(domain,type,
domain: $i > $i ).
tff(there_exists,type,
there_exists: $i > $o ).
tff(codomain,type,
codomain: $i > $i ).
tff(d,type,
d: $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f_121,axiom,
codomain(a) != d,
file(unknown,unknown) ).
tff(f_109,axiom,
there_exists(compose(d,a)),
file(unknown,unknown) ).
tff(f_119,axiom,
! [X] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) ),
file(unknown,unknown) ).
tff(f_86,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
file(unknown,unknown) ).
tff(f_76,axiom,
! [X] :
( ~ there_exists(domain(X))
| there_exists(X) ),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X] : ( compose(X,domain(X)) = X ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
file(unknown,unknown) ).
tff(c_30,plain,
codomain(a) != d,
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_24,plain,
there_exists(compose(d,a)),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_93,plain,
! [X_36] :
( ( compose(d,X_36) = X_36 )
| ~ there_exists(compose(d,X_36)) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_103,plain,
compose(d,a) = a,
inference(resolution,[status(thm)],[c_24,c_93]) ).
tff(c_123,plain,
there_exists(a),
inference(demodulation,[status(thm),theory(equality)],[c_103,c_24]) ).
tff(c_63,plain,
! [X_31,Y_32] :
( there_exists(domain(X_31))
| ~ there_exists(compose(X_31,Y_32)) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_73,plain,
there_exists(domain(d)),
inference(resolution,[status(thm)],[c_24,c_63]) ).
tff(c_8,plain,
! [X_7] :
( there_exists(X_7)
| ~ there_exists(domain(X_7)) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_77,plain,
there_exists(d),
inference(resolution,[status(thm)],[c_73,c_8]) ).
tff(c_20,plain,
! [X_18] : ( compose(X_18,domain(X_18)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_97,plain,
( ( compose(d,domain(d)) = domain(d) )
| ~ there_exists(d) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_93]) ).
tff(c_102,plain,
domain(d) = d,
inference(demodulation,[status(thm),theory(equality)],[c_77,c_20,c_97]) ).
tff(c_185,plain,
! [X_38,Y_39] :
( ( domain(X_38) = codomain(Y_39) )
| ~ there_exists(compose(X_38,Y_39)) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_191,plain,
( ( domain(d) = codomain(a) )
| ~ there_exists(a) ),
inference(superposition,[status(thm),theory(equality)],[c_103,c_185]) ).
tff(c_201,plain,
codomain(a) = d,
inference(demodulation,[status(thm),theory(equality)],[c_123,c_102,c_191]) ).
tff(c_203,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_30,c_201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT006-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/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.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 18:02:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.92/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.92/1.79
% 2.92/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.14/1.82
% 3.14/1.82 Inference rules
% 3.14/1.82 ----------------------
% 3.14/1.82 #Ref : 0
% 3.14/1.82 #Sup : 40
% 3.14/1.82 #Fact : 0
% 3.14/1.82 #Define : 0
% 3.14/1.82 #Split : 0
% 3.14/1.82 #Chain : 0
% 3.14/1.82 #Close : 0
% 3.14/1.82
% 3.14/1.82 Ordering : KBO
% 3.14/1.82
% 3.14/1.82 Simplification rules
% 3.14/1.82 ----------------------
% 3.14/1.82 #Subsume : 0
% 3.14/1.82 #Demod : 34
% 3.14/1.82 #Tautology : 29
% 3.14/1.82 #SimpNegUnit : 1
% 3.14/1.82 #BackRed : 2
% 3.14/1.82
% 3.14/1.82 #Partial instantiations: 0
% 3.14/1.82 #Strategies tried : 1
% 3.14/1.82
% 3.14/1.82 Timing (in seconds)
% 3.14/1.82 ----------------------
% 3.14/1.82 Preprocessing : 0.47
% 3.14/1.82 Parsing : 0.24
% 3.14/1.82 CNF conversion : 0.02
% 3.14/1.82 Main loop : 0.24
% 3.14/1.82 Inferencing : 0.09
% 3.14/1.82 Reduction : 0.07
% 3.14/1.82 Demodulation : 0.05
% 3.14/1.82 BG Simplification : 0.01
% 3.14/1.82 Subsumption : 0.05
% 3.14/1.82 Abstraction : 0.01
% 3.14/1.82 MUC search : 0.00
% 3.14/1.82 Cooper : 0.00
% 3.14/1.82 Total : 0.75
% 3.14/1.82 Index Insertion : 0.00
% 3.14/1.82 Index Deletion : 0.00
% 3.14/1.82 Index Matching : 0.00
% 3.14/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------