TSTP Solution File: SEU030+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU030+1 : TPTP v8.1.2. Released v3.2.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:57:31 EDT 2023
% Result : Theorem 39.73s 26.51s
% Output : CNFRefutation 40.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 33
% Syntax : Number of formulae : 62 ( 14 unt; 28 typ; 0 def)
% Number of atoms : 133 ( 40 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 179 ( 80 ~; 72 |; 15 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 17 >; 4 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 11 con; 0-2 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > one_to_one > function > empty > relation_composition > #nlpp > relation_rng > relation_dom > powerset > identity_relation > function_inverse > empty_set > #skF_4 > #skF_11 > #skF_1 > #skF_8 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_13 > #skF_2 > #skF_3 > #skF_9 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation,type,
relation: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff(function,type,
function: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(identity_relation,type,
identity_relation: $i > $i ).
tff(function_inverse,type,
function_inverse: $i > $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(relation_composition,type,
relation_composition: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_279,negated_conjecture,
~ ! [A] :
( ( relation(A)
& function(A) )
=> ! [B] :
( ( relation(B)
& function(B) )
=> ( ( one_to_one(A)
& ( relation_rng(A) = relation_dom(B) )
& ( relation_composition(A,B) = identity_relation(relation_dom(A)) ) )
=> ( B = function_inverse(A) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_funct_1) ).
tff(f_261,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> ( ( relation_composition(A,function_inverse(A)) = identity_relation(relation_dom(A)) )
& ( relation_composition(function_inverse(A),A) = identity_relation(relation_rng(A)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t61_funct_1) ).
tff(f_59,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ( relation(function_inverse(A))
& function(function_inverse(A)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_funct_1) ).
tff(f_244,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> ( ( relation_rng(A) = relation_dom(function_inverse(A)) )
& ( relation_dom(A) = relation_rng(function_inverse(A)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_funct_1) ).
tff(f_164,axiom,
! [A,B] :
( ( relation(B)
& function(B) )
=> ! [C] :
( ( relation(C)
& function(C) )
=> ! [D] :
( ( relation(D)
& function(D) )
=> ( ( ( relation_rng(B) = A )
& ( relation_composition(B,C) = identity_relation(relation_dom(D)) )
& ( relation_composition(C,D) = identity_relation(A) ) )
=> ( D = B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l72_funct_1) ).
tff(c_144,plain,
relation('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_279]) ).
tff(c_142,plain,
function('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_279]) ).
tff(c_136,plain,
one_to_one('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_279]) ).
tff(c_134,plain,
relation_rng('#skF_12') = relation_dom('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_279]) ).
tff(c_126,plain,
! [A_51] :
( ( relation_composition(function_inverse(A_51),A_51) = identity_relation(relation_rng(A_51)) )
| ~ one_to_one(A_51)
| ~ function(A_51)
| ~ relation(A_51) ),
inference(cnfTransformation,[status(thm)],[f_261]) ).
tff(c_130,plain,
function_inverse('#skF_12') != '#skF_13',
inference(cnfTransformation,[status(thm)],[f_279]) ).
tff(c_140,plain,
relation('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_279]) ).
tff(c_138,plain,
function('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_279]) ).
tff(c_14,plain,
! [A_6] :
( function(function_inverse(A_6))
| ~ function(A_6)
| ~ relation(A_6) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_16,plain,
! [A_6] :
( relation(function_inverse(A_6))
| ~ function(A_6)
| ~ relation(A_6) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_132,plain,
identity_relation(relation_dom('#skF_12')) = relation_composition('#skF_12','#skF_13'),
inference(cnfTransformation,[status(thm)],[f_279]) ).
tff(c_120,plain,
! [A_47] :
( ( relation_rng(function_inverse(A_47)) = relation_dom(A_47) )
| ~ one_to_one(A_47)
| ~ function(A_47)
| ~ relation(A_47) ),
inference(cnfTransformation,[status(thm)],[f_244]) ).
tff(c_2583,plain,
! [D_181,B_182,C_183] :
( ( D_181 = B_182 )
| ( relation_composition(C_183,D_181) != identity_relation(relation_rng(B_182)) )
| ( relation_composition(B_182,C_183) != identity_relation(relation_dom(D_181)) )
| ~ function(D_181)
| ~ relation(D_181)
| ~ function(C_183)
| ~ relation(C_183)
| ~ function(B_182)
| ~ relation(B_182) ),
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_23877,plain,
! [A_389,D_390,C_391] :
( ( function_inverse(A_389) = D_390 )
| ( relation_composition(C_391,D_390) != identity_relation(relation_dom(A_389)) )
| ( relation_composition(function_inverse(A_389),C_391) != identity_relation(relation_dom(D_390)) )
| ~ function(D_390)
| ~ relation(D_390)
| ~ function(C_391)
| ~ relation(C_391)
| ~ function(function_inverse(A_389))
| ~ relation(function_inverse(A_389))
| ~ one_to_one(A_389)
| ~ function(A_389)
| ~ relation(A_389) ),
inference(superposition,[status(thm),theory(equality)],[c_120,c_2583]) ).
tff(c_24043,plain,
! [D_390,C_391] :
( ( function_inverse('#skF_12') = D_390 )
| ( relation_composition(C_391,D_390) != relation_composition('#skF_12','#skF_13') )
| ( relation_composition(function_inverse('#skF_12'),C_391) != identity_relation(relation_dom(D_390)) )
| ~ function(D_390)
| ~ relation(D_390)
| ~ function(C_391)
| ~ relation(C_391)
| ~ function(function_inverse('#skF_12'))
| ~ relation(function_inverse('#skF_12'))
| ~ one_to_one('#skF_12')
| ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(superposition,[status(thm),theory(equality)],[c_132,c_23877]) ).
tff(c_24171,plain,
! [D_390,C_391] :
( ( function_inverse('#skF_12') = D_390 )
| ( relation_composition(C_391,D_390) != relation_composition('#skF_12','#skF_13') )
| ( relation_composition(function_inverse('#skF_12'),C_391) != identity_relation(relation_dom(D_390)) )
| ~ function(D_390)
| ~ relation(D_390)
| ~ function(C_391)
| ~ relation(C_391)
| ~ function(function_inverse('#skF_12'))
| ~ relation(function_inverse('#skF_12')) ),
inference(demodulation,[status(thm),theory(equality)],[c_144,c_142,c_136,c_24043]) ).
tff(c_182906,plain,
~ relation(function_inverse('#skF_12')),
inference(splitLeft,[status(thm)],[c_24171]) ).
tff(c_182909,plain,
( ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(resolution,[status(thm)],[c_16,c_182906]) ).
tff(c_182916,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_144,c_142,c_182909]) ).
tff(c_182917,plain,
! [D_390,C_391] :
( ~ function(function_inverse('#skF_12'))
| ( function_inverse('#skF_12') = D_390 )
| ( relation_composition(C_391,D_390) != relation_composition('#skF_12','#skF_13') )
| ( relation_composition(function_inverse('#skF_12'),C_391) != identity_relation(relation_dom(D_390)) )
| ~ function(D_390)
| ~ relation(D_390)
| ~ function(C_391)
| ~ relation(C_391) ),
inference(splitRight,[status(thm)],[c_24171]) ).
tff(c_185573,plain,
~ function(function_inverse('#skF_12')),
inference(splitLeft,[status(thm)],[c_182917]) ).
tff(c_185576,plain,
( ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(resolution,[status(thm)],[c_14,c_185573]) ).
tff(c_185583,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_144,c_142,c_185576]) ).
tff(c_185584,plain,
! [D_390,C_391] :
( ( function_inverse('#skF_12') = D_390 )
| ( relation_composition(C_391,D_390) != relation_composition('#skF_12','#skF_13') )
| ( relation_composition(function_inverse('#skF_12'),C_391) != identity_relation(relation_dom(D_390)) )
| ~ function(D_390)
| ~ relation(D_390)
| ~ function(C_391)
| ~ relation(C_391) ),
inference(splitRight,[status(thm)],[c_182917]) ).
tff(c_189843,plain,
( ( function_inverse('#skF_12') = '#skF_13' )
| ( relation_composition(function_inverse('#skF_12'),'#skF_12') != identity_relation(relation_dom('#skF_13')) )
| ~ function('#skF_13')
| ~ relation('#skF_13')
| ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(reflexivity,[status(thm),theory(equality)],[c_185584]) ).
tff(c_189845,plain,
( ( function_inverse('#skF_12') = '#skF_13' )
| ( relation_composition(function_inverse('#skF_12'),'#skF_12') != identity_relation(relation_dom('#skF_13')) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_144,c_142,c_140,c_138,c_189843]) ).
tff(c_189846,plain,
relation_composition(function_inverse('#skF_12'),'#skF_12') != identity_relation(relation_dom('#skF_13')),
inference(negUnitSimplification,[status(thm)],[c_130,c_189845]) ).
tff(c_190913,plain,
( ( identity_relation(relation_rng('#skF_12')) != identity_relation(relation_dom('#skF_13')) )
| ~ one_to_one('#skF_12')
| ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(superposition,[status(thm),theory(equality)],[c_126,c_189846]) ).
tff(c_190918,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_144,c_142,c_136,c_134,c_190913]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU030+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12 % 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.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 11:49:59 EDT 2023
% 0.12/0.33 % CPUTime :
% 39.73/26.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 39.73/26.52
% 39.73/26.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 40.07/26.55
% 40.07/26.55 Inference rules
% 40.07/26.55 ----------------------
% 40.07/26.55 #Ref : 1
% 40.07/26.55 #Sup : 54486
% 40.07/26.55 #Fact : 0
% 40.07/26.55 #Define : 0
% 40.07/26.55 #Split : 44
% 40.07/26.55 #Chain : 0
% 40.07/26.55 #Close : 0
% 40.07/26.55
% 40.07/26.55 Ordering : KBO
% 40.07/26.55
% 40.07/26.55 Simplification rules
% 40.07/26.55 ----------------------
% 40.07/26.55 #Subsume : 14385
% 40.07/26.55 #Demod : 24364
% 40.07/26.55 #Tautology : 8727
% 40.07/26.55 #SimpNegUnit : 92
% 40.07/26.55 #BackRed : 29
% 40.07/26.55
% 40.07/26.55 #Partial instantiations: 0
% 40.07/26.55 #Strategies tried : 1
% 40.07/26.55
% 40.07/26.55 Timing (in seconds)
% 40.07/26.55 ----------------------
% 40.07/26.55 Preprocessing : 0.58
% 40.07/26.55 Parsing : 0.29
% 40.07/26.55 CNF conversion : 0.05
% 40.07/26.55 Main loop : 24.93
% 40.07/26.55 Inferencing : 2.69
% 40.07/26.55 Reduction : 6.92
% 40.07/26.55 Demodulation : 5.22
% 40.07/26.55 BG Simplification : 0.28
% 40.07/26.55 Subsumption : 13.72
% 40.07/26.55 Abstraction : 0.33
% 40.07/26.55 MUC search : 0.00
% 40.07/26.56 Cooper : 0.00
% 40.07/26.56 Total : 25.57
% 40.07/26.56 Index Insertion : 0.00
% 40.07/26.56 Index Deletion : 0.00
% 40.07/26.56 Index Matching : 0.00
% 40.07/26.56 BG Taut test : 0.00
%------------------------------------------------------------------------------