TSTP Solution File: CAT010-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT010-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 : 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:38 EDT 2023
% Result : Unsatisfiable 6.17s 2.55s
% Output : CNFRefutation 6.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 35 ( 19 unt; 7 typ; 0 def)
% Number of atoms : 37 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 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 : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equivalent > there_exists > compose > #nlpp > domain > codomain > b > 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(b,type,
b: $i ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f_110,axiom,
codomain(compose(a,b)) != codomain(a),
file(unknown,unknown) ).
tff(f_108,axiom,
there_exists(compose(a,b)),
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_91,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X] : ( compose(X,domain(X)) = X ),
file(unknown,unknown) ).
tff(f_105,axiom,
! [X] : ( compose(codomain(X),X) = X ),
file(unknown,unknown) ).
tff(f_101,axiom,
! [X,Y,Z] : ( compose(X,compose(Y,Z)) = compose(compose(X,Y),Z) ),
file(unknown,unknown) ).
tff(c_26,plain,
codomain(compose(a,b)) != codomain(a),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_24,plain,
there_exists(compose(a,b)),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_59,plain,
! [X_29,Y_30] :
( there_exists(domain(X_29))
| ~ there_exists(compose(X_29,Y_30)) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_69,plain,
there_exists(domain(a)),
inference(resolution,[status(thm)],[c_24,c_59]) ).
tff(c_8,plain,
! [X_7] :
( there_exists(X_7)
| ~ there_exists(domain(X_7)) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_73,plain,
there_exists(a),
inference(resolution,[status(thm)],[c_69,c_8]) ).
tff(c_89,plain,
! [X_34,Y_35] :
( ( domain(X_34) = codomain(Y_35) )
| ~ there_exists(compose(X_34,Y_35)) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_99,plain,
domain(a) = codomain(b),
inference(resolution,[status(thm)],[c_24,c_89]) ).
tff(c_20,plain,
! [X_18] : ( compose(X_18,domain(X_18)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_110,plain,
compose(a,codomain(b)) = a,
inference(superposition,[status(thm),theory(equality)],[c_99,c_20]) ).
tff(c_22,plain,
! [X_19] : ( compose(codomain(X_19),X_19) = X_19 ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_121,plain,
! [X_36,Y_37,Z_38] : ( compose(compose(X_36,Y_37),Z_38) = compose(X_36,compose(Y_37,Z_38)) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_617,plain,
! [X_49,Z_50] : ( compose(codomain(X_49),compose(X_49,Z_50)) = compose(X_49,Z_50) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_121]) ).
tff(c_14,plain,
! [X_11,Y_12] :
( ( domain(X_11) = codomain(Y_12) )
| ~ there_exists(compose(X_11,Y_12)) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_5621,plain,
! [X_117,Z_118] :
( ( domain(codomain(X_117)) = codomain(compose(X_117,Z_118)) )
| ~ there_exists(compose(X_117,Z_118)) ),
inference(superposition,[status(thm),theory(equality)],[c_617,c_14]) ).
tff(c_5699,plain,
( ( codomain(compose(a,codomain(b))) = domain(codomain(a)) )
| ~ there_exists(a) ),
inference(superposition,[status(thm),theory(equality)],[c_110,c_5621]) ).
tff(c_5737,plain,
domain(codomain(a)) = codomain(a),
inference(demodulation,[status(thm),theory(equality)],[c_73,c_110,c_5699]) ).
tff(c_5741,plain,
domain(codomain(a)) = codomain(compose(a,b)),
inference(resolution,[status(thm)],[c_24,c_5621]) ).
tff(c_6135,plain,
codomain(compose(a,b)) = codomain(a),
inference(demodulation,[status(thm),theory(equality)],[c_5737,c_5741]) ).
tff(c_6136,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26,c_6135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CAT010-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/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.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:35:14 EDT 2023
% 0.14/0.35 % CPUTime :
% 6.17/2.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.17/2.56
% 6.17/2.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.29/2.58
% 6.29/2.58 Inference rules
% 6.29/2.58 ----------------------
% 6.29/2.58 #Ref : 0
% 6.29/2.58 #Sup : 1623
% 6.29/2.58 #Fact : 0
% 6.29/2.58 #Define : 0
% 6.29/2.58 #Split : 0
% 6.29/2.58 #Chain : 0
% 6.29/2.58 #Close : 0
% 6.29/2.58
% 6.29/2.58 Ordering : KBO
% 6.29/2.58
% 6.29/2.58 Simplification rules
% 6.29/2.58 ----------------------
% 6.29/2.58 #Subsume : 409
% 6.29/2.58 #Demod : 1421
% 6.29/2.58 #Tautology : 607
% 6.29/2.58 #SimpNegUnit : 1
% 6.29/2.58 #BackRed : 6
% 6.29/2.58
% 6.29/2.58 #Partial instantiations: 0
% 6.29/2.58 #Strategies tried : 1
% 6.29/2.58
% 6.29/2.58 Timing (in seconds)
% 6.29/2.58 ----------------------
% 6.29/2.59 Preprocessing : 0.44
% 6.29/2.59 Parsing : 0.23
% 6.29/2.59 CNF conversion : 0.02
% 6.29/2.59 Main loop : 1.03
% 6.29/2.59 Inferencing : 0.38
% 6.29/2.59 Reduction : 0.35
% 6.29/2.59 Demodulation : 0.27
% 6.29/2.59 BG Simplification : 0.04
% 6.29/2.59 Subsumption : 0.21
% 6.29/2.59 Abstraction : 0.05
% 6.29/2.59 MUC search : 0.00
% 6.29/2.59 Cooper : 0.00
% 6.29/2.59 Total : 1.52
% 6.29/2.59 Index Insertion : 0.00
% 6.29/2.59 Index Deletion : 0.00
% 6.29/2.59 Index Matching : 0.00
% 6.29/2.59 BG Taut test : 0.00
%------------------------------------------------------------------------------