TSTP Solution File: CAT010-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT010-10 : TPTP v8.1.2. Released v7.3.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 : n028.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:37 EDT 2023
% Result : Unsatisfiable 12.01s 4.81s
% Output : CNFRefutation 12.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of formulae : 41 ( 30 unt; 11 typ; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 19 ( 8 >; 11 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-4 aty)
% Number of variables : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ifeq3 > ifeq2 > ifeq > equivalent > compose > #nlpp > there_exists > domain > codomain > true > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(domain,type,
domain: $i > $i ).
tff(ifeq2,type,
ifeq2: ( $i * $i * $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(there_exists,type,
there_exists: $i > $i ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(true,type,
true: $i ).
tff(equivalent,type,
equivalent: ( $i * $i ) > $i ).
tff(ifeq3,type,
ifeq3: ( $i * $i * $i * $i ) > $i ).
tff(ifeq,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(f_53,axiom,
codomain(compose(a,b)) != codomain(a),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,B,C] : ( ifeq2(A,A,B,C) = B ),
file(unknown,unknown) ).
tff(f_51,axiom,
there_exists(compose(a,b)) = true,
file(unknown,unknown) ).
tff(f_40,axiom,
! [X,Y] : ( ifeq(there_exists(compose(X,Y)),true,there_exists(domain(X)),true) = true ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [A,B,C] : ( ifeq(A,A,B,C) = B ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X] : ( ifeq(there_exists(domain(X)),true,there_exists(X),true) = true ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X] : ( compose(codomain(X),X) = X ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [X,Y] : ( ifeq2(there_exists(compose(X,Y)),true,domain(X),codomain(Y)) = codomain(Y) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X,Y,Z] : ( compose(X,compose(Y,Z)) = compose(compose(X,Y),Z) ),
file(unknown,unknown) ).
tff(c_32,plain,
codomain(compose(a,b)) != codomain(a),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_4,plain,
! [A_4,B_5,C_6] : ( ifeq2(A_4,A_4,B_5,C_6) = B_5 ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_30,plain,
there_exists(compose(a,b)) = true,
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_211,plain,
! [X_52,Y_53] : ( ifeq(there_exists(compose(X_52,Y_53)),true,there_exists(domain(X_52)),true) = true ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_233,plain,
ifeq(true,true,there_exists(domain(a)),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_30,c_211]) ).
tff(c_6,plain,
! [A_7,B_8,C_9] : ( ifeq(A_7,A_7,B_8,C_9) = B_8 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_258,plain,
there_exists(domain(a)) = true,
inference(superposition,[status(thm),theory(equality)],[c_233,c_6]) ).
tff(c_14,plain,
! [X_15] : ( ifeq(there_exists(domain(X_15)),true,there_exists(X_15),true) = true ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_273,plain,
ifeq(true,true,there_exists(a),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_258,c_14]) ).
tff(c_323,plain,
there_exists(a) = true,
inference(superposition,[status(thm),theory(equality)],[c_273,c_6]) ).
tff(c_28,plain,
! [X_27] : ( compose(codomain(X_27),X_27) = X_27 ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_289,plain,
! [X_55,Y_56] : ( ifeq2(there_exists(compose(X_55,Y_56)),true,domain(X_55),codomain(Y_56)) = codomain(Y_56) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_1766,plain,
! [X_79] : ( ifeq2(there_exists(X_79),true,domain(codomain(X_79)),codomain(X_79)) = codomain(X_79) ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_289]) ).
tff(c_1802,plain,
ifeq2(true,true,domain(codomain(a)),codomain(a)) = codomain(a),
inference(superposition,[status(thm),theory(equality)],[c_323,c_1766]) ).
tff(c_3389,plain,
domain(codomain(a)) = codomain(a),
inference(superposition,[status(thm),theory(equality)],[c_1802,c_4]) ).
tff(c_131,plain,
! [X_46,Y_47,Z_48] : ( compose(compose(X_46,Y_47),Z_48) = compose(X_46,compose(Y_47,Z_48)) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_150,plain,
! [X_27,Z_48] : ( compose(codomain(X_27),compose(X_27,Z_48)) = compose(X_27,Z_48) ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_131]) ).
tff(c_23099,plain,
! [X_193,Z_194] : ( ifeq2(there_exists(compose(X_193,Z_194)),true,domain(codomain(X_193)),codomain(compose(X_193,Z_194))) = codomain(compose(X_193,Z_194)) ),
inference(superposition,[status(thm),theory(equality)],[c_150,c_289]) ).
tff(c_23591,plain,
ifeq2(true,true,domain(codomain(a)),codomain(compose(a,b))) = codomain(compose(a,b)),
inference(superposition,[status(thm),theory(equality)],[c_30,c_23099]) ).
tff(c_23753,plain,
codomain(compose(a,b)) = codomain(a),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_3389,c_23591]) ).
tff(c_23755,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32,c_23753]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CAT010-10 : TPTP v8.1.2. Released v7.3.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.17/0.35 % Computer : n028.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 18:05:09 EDT 2023
% 0.17/0.35 % CPUTime :
% 12.01/4.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.08/4.82
% 12.08/4.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.08/4.84
% 12.08/4.84 Inference rules
% 12.08/4.84 ----------------------
% 12.08/4.84 #Ref : 0
% 12.08/4.84 #Sup : 5899
% 12.08/4.84 #Fact : 0
% 12.08/4.84 #Define : 0
% 12.08/4.84 #Split : 0
% 12.08/4.84 #Chain : 0
% 12.08/4.84 #Close : 0
% 12.08/4.84
% 12.08/4.84 Ordering : KBO
% 12.08/4.84
% 12.08/4.84 Simplification rules
% 12.08/4.84 ----------------------
% 12.08/4.84 #Subsume : 0
% 12.08/4.84 #Demod : 11542
% 12.08/4.84 #Tautology : 3612
% 12.08/4.84 #SimpNegUnit : 1
% 12.08/4.84 #BackRed : 39
% 12.08/4.84
% 12.08/4.84 #Partial instantiations: 0
% 12.08/4.84 #Strategies tried : 1
% 12.08/4.84
% 12.08/4.84 Timing (in seconds)
% 12.08/4.84 ----------------------
% 12.08/4.84 Preprocessing : 0.44
% 12.08/4.84 Parsing : 0.24
% 12.08/4.84 CNF conversion : 0.02
% 12.08/4.85 Main loop : 3.36
% 12.08/4.85 Inferencing : 0.68
% 12.08/4.85 Reduction : 2.04
% 12.08/4.85 Demodulation : 1.85
% 12.08/4.85 BG Simplification : 0.07
% 12.08/4.85 Subsumption : 0.44
% 12.08/4.85 Abstraction : 0.12
% 12.08/4.85 MUC search : 0.00
% 12.08/4.85 Cooper : 0.00
% 12.08/4.85 Total : 3.85
% 12.08/4.85 Index Insertion : 0.00
% 12.08/4.85 Index Deletion : 0.00
% 12.08/4.87 Index Matching : 0.00
% 12.08/4.87 BG Taut test : 0.00
%------------------------------------------------------------------------------