TSTP Solution File: CAT009-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT009-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 : n001.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 6.77s 2.94s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 33 ( 16 unt; 7 typ; 0 def)
% Number of atoms : 36 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 24 ( 14 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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_109,axiom,
there_exists(compose(a,b)),
file(unknown,unknown) ).
tff(f_92,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
file(unknown,unknown) ).
tff(f_87,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
file(unknown,unknown) ).
tff(f_82,axiom,
! [X] :
( ~ there_exists(codomain(X))
| there_exists(X) ),
file(unknown,unknown) ).
tff(f_104,axiom,
! [X] : ( compose(X,domain(X)) = X ),
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_111,axiom,
domain(compose(a,b)) != domain(b),
file(unknown,unknown) ).
tff(c_24,plain,
there_exists(compose(a,b)),
inference(cnfTransformation,[status(thm)],[f_109]) ).
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_92]) ).
tff(c_99,plain,
domain(a) = codomain(b),
inference(resolution,[status(thm)],[c_24,c_89]) ).
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_87]) ).
tff(c_69,plain,
there_exists(domain(a)),
inference(resolution,[status(thm)],[c_24,c_59]) ).
tff(c_100,plain,
there_exists(codomain(b)),
inference(demodulation,[status(thm),theory(equality)],[c_99,c_69]) ).
tff(c_10,plain,
! [X_8] :
( there_exists(X_8)
| ~ there_exists(codomain(X_8)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_120,plain,
there_exists(b),
inference(resolution,[status(thm)],[c_100,c_10]) ).
tff(c_20,plain,
! [X_18] : ( compose(X_18,domain(X_18)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_95,plain,
! [X_18] :
( ( codomain(domain(X_18)) = domain(X_18) )
| ~ there_exists(X_18) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_89]) ).
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_102]) ).
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_92]) ).
tff(c_3370,plain,
! [X_92,Y_93,Z_94] :
( ( domain(compose(X_92,Y_93)) = codomain(Z_94) )
| ~ there_exists(compose(X_92,compose(Y_93,Z_94))) ),
inference(superposition,[status(thm),theory(equality)],[c_121,c_14]) ).
tff(c_8526,plain,
! [X_136,X_137] :
( ( domain(compose(X_136,X_137)) = codomain(domain(X_137)) )
| ~ there_exists(compose(X_136,X_137)) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_3370]) ).
tff(c_8666,plain,
domain(compose(a,b)) = codomain(domain(b)),
inference(resolution,[status(thm)],[c_24,c_8526]) ).
tff(c_26,plain,
domain(compose(a,b)) != domain(b),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_8667,plain,
codomain(domain(b)) != domain(b),
inference(demodulation,[status(thm),theory(equality)],[c_8666,c_26]) ).
tff(c_8843,plain,
~ there_exists(b),
inference(superposition,[status(thm),theory(equality)],[c_95,c_8667]) ).
tff(c_8847,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_120,c_8843]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CAT009-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.14/0.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:20:40 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.77/2.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.77/2.95
% 6.77/2.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.56/2.97
% 7.56/2.97 Inference rules
% 7.56/2.97 ----------------------
% 7.56/2.97 #Ref : 0
% 7.56/2.97 #Sup : 2357
% 7.56/2.97 #Fact : 0
% 7.56/2.97 #Define : 0
% 7.56/2.97 #Split : 1
% 7.56/2.97 #Chain : 0
% 7.56/2.98 #Close : 0
% 7.56/2.98
% 7.56/2.98 Ordering : KBO
% 7.56/2.98
% 7.56/2.98 Simplification rules
% 7.56/2.98 ----------------------
% 7.56/2.98 #Subsume : 603
% 7.56/2.98 #Demod : 2277
% 7.56/2.98 #Tautology : 827
% 7.56/2.98 #SimpNegUnit : 0
% 7.56/2.98 #BackRed : 7
% 7.56/2.98
% 7.56/2.98 #Partial instantiations: 0
% 7.56/2.98 #Strategies tried : 1
% 7.56/2.98
% 7.56/2.98 Timing (in seconds)
% 7.56/2.98 ----------------------
% 7.56/2.98 Preprocessing : 0.47
% 7.56/2.98 Parsing : 0.24
% 7.56/2.98 CNF conversion : 0.02
% 7.56/2.98 Main loop : 1.34
% 7.56/2.98 Inferencing : 0.47
% 7.56/2.98 Reduction : 0.46
% 7.56/2.98 Demodulation : 0.36
% 7.56/2.98 BG Simplification : 0.05
% 7.56/2.98 Subsumption : 0.27
% 7.56/2.98 Abstraction : 0.06
% 7.56/2.98 MUC search : 0.00
% 7.56/2.98 Cooper : 0.00
% 7.56/2.98 Total : 1.86
% 7.56/2.98 Index Insertion : 0.00
% 7.56/2.98 Index Deletion : 0.00
% 7.56/2.98 Index Matching : 0.00
% 7.56/2.98 BG Taut test : 0.00
%------------------------------------------------------------------------------