TSTP Solution File: SEU023+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU023+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 : n008.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:30 EDT 2023
% Result : Theorem 9.05s 3.43s
% Output : CNFRefutation 9.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 36
% Syntax : Number of formulae : 66 ( 15 unt; 32 typ; 0 def)
% Number of atoms : 96 ( 19 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 113 ( 51 ~; 35 |; 15 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 21 >; 9 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 11 con; 0-2 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > one_to_one > function > empty > relation_composition > apply > #nlpp > relation_rng > relation_dom > powerset > function_inverse > empty_set > #skF_4 > #skF_17 > #skF_11 > #skF_1 > #skF_8 > #skF_7 > #skF_13 > #skF_10 > #skF_16 > #skF_14 > #skF_12 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_9 > #skF_15
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation,type,
relation: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(apply,type,
apply: ( $i * $i ) > $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_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(function_inverse,type,
function_inverse: $i > $i ).
tff('#skF_6',type,
'#skF_6': $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_15',type,
'#skF_15': ( $i * $i ) > $i ).
tff(f_264,negated_conjecture,
~ ! [A,B] :
( ( relation(B)
& function(B) )
=> ( ( one_to_one(B)
& in(A,relation_dom(B)) )
=> ( ( A = apply(function_inverse(B),apply(B,A)) )
& ( A = apply(relation_composition(B,function_inverse(B)),A) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t56_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_251,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> ! [B] :
( ( relation(B)
& function(B) )
=> ( ( B = function_inverse(A) )
<=> ( ( relation_dom(B) = relation_rng(A) )
& ! [C,D] :
( ( ( in(C,relation_rng(A))
& ( D = apply(B,C) ) )
=> ( in(D,relation_dom(A))
& ( C = apply(A,D) ) ) )
& ( ( in(D,relation_dom(A))
& ( C = apply(A,D) ) )
=> ( in(C,relation_rng(A))
& ( D = apply(B,C) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_funct_1) ).
tff(f_203,axiom,
! [A,B] :
( ( relation(B)
& function(B) )
=> ! [C] :
( ( relation(C)
& function(C) )
=> ( in(A,relation_dom(B))
=> ( apply(relation_composition(B,C),A) = apply(C,apply(B,A)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).
tff(c_150,plain,
relation('#skF_17'),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_148,plain,
function('#skF_17'),
inference(cnfTransformation,[status(thm)],[f_264]) ).
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_146,plain,
one_to_one('#skF_17'),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_144,plain,
in('#skF_16',relation_dom('#skF_17')),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_3019,plain,
! [A_198,D_199] :
( ( apply(function_inverse(A_198),apply(A_198,D_199)) = D_199 )
| ~ in(D_199,relation_dom(A_198))
| ~ function(function_inverse(A_198))
| ~ relation(function_inverse(A_198))
| ~ one_to_one(A_198)
| ~ function(A_198)
| ~ relation(A_198) ),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_142,plain,
( ( apply(relation_composition('#skF_17',function_inverse('#skF_17')),'#skF_16') != '#skF_16' )
| ( apply(function_inverse('#skF_17'),apply('#skF_17','#skF_16')) != '#skF_16' ) ),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_189,plain,
apply(function_inverse('#skF_17'),apply('#skF_17','#skF_16')) != '#skF_16',
inference(splitLeft,[status(thm)],[c_142]) ).
tff(c_3037,plain,
( ~ in('#skF_16',relation_dom('#skF_17'))
| ~ function(function_inverse('#skF_17'))
| ~ relation(function_inverse('#skF_17'))
| ~ one_to_one('#skF_17')
| ~ function('#skF_17')
| ~ relation('#skF_17') ),
inference(superposition,[status(thm),theory(equality)],[c_3019,c_189]) ).
tff(c_3051,plain,
( ~ function(function_inverse('#skF_17'))
| ~ relation(function_inverse('#skF_17')) ),
inference(demodulation,[status(thm),theory(equality)],[c_150,c_148,c_146,c_144,c_3037]) ).
tff(c_3054,plain,
~ relation(function_inverse('#skF_17')),
inference(splitLeft,[status(thm)],[c_3051]) ).
tff(c_3057,plain,
( ~ function('#skF_17')
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_16,c_3054]) ).
tff(c_3064,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_150,c_148,c_3057]) ).
tff(c_3065,plain,
~ function(function_inverse('#skF_17')),
inference(splitRight,[status(thm)],[c_3051]) ).
tff(c_3292,plain,
( ~ function('#skF_17')
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_14,c_3065]) ).
tff(c_3299,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_150,c_148,c_3292]) ).
tff(c_3301,plain,
apply(function_inverse('#skF_17'),apply('#skF_17','#skF_16')) = '#skF_16',
inference(splitRight,[status(thm)],[c_142]) ).
tff(c_5567,plain,
! [B_312,C_313,A_314] :
( ( apply(relation_composition(B_312,C_313),A_314) = apply(C_313,apply(B_312,A_314)) )
| ~ in(A_314,relation_dom(B_312))
| ~ function(C_313)
| ~ relation(C_313)
| ~ function(B_312)
| ~ relation(B_312) ),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_5578,plain,
! [C_313] :
( ( apply(relation_composition('#skF_17',C_313),'#skF_16') = apply(C_313,apply('#skF_17','#skF_16')) )
| ~ function(C_313)
| ~ relation(C_313)
| ~ function('#skF_17')
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_144,c_5567]) ).
tff(c_8783,plain,
! [C_381] :
( ( apply(relation_composition('#skF_17',C_381),'#skF_16') = apply(C_381,apply('#skF_17','#skF_16')) )
| ~ function(C_381)
| ~ relation(C_381) ),
inference(demodulation,[status(thm),theory(equality)],[c_150,c_148,c_5578]) ).
tff(c_3300,plain,
apply(relation_composition('#skF_17',function_inverse('#skF_17')),'#skF_16') != '#skF_16',
inference(splitRight,[status(thm)],[c_142]) ).
tff(c_8795,plain,
( ( apply(function_inverse('#skF_17'),apply('#skF_17','#skF_16')) != '#skF_16' )
| ~ function(function_inverse('#skF_17'))
| ~ relation(function_inverse('#skF_17')) ),
inference(superposition,[status(thm),theory(equality)],[c_8783,c_3300]) ).
tff(c_8824,plain,
( ~ function(function_inverse('#skF_17'))
| ~ relation(function_inverse('#skF_17')) ),
inference(demodulation,[status(thm),theory(equality)],[c_3301,c_8795]) ).
tff(c_8828,plain,
~ relation(function_inverse('#skF_17')),
inference(splitLeft,[status(thm)],[c_8824]) ).
tff(c_8831,plain,
( ~ function('#skF_17')
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_16,c_8828]) ).
tff(c_8838,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_150,c_148,c_8831]) ).
tff(c_8839,plain,
~ function(function_inverse('#skF_17')),
inference(splitRight,[status(thm)],[c_8824]) ).
tff(c_8843,plain,
( ~ function('#skF_17')
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_14,c_8839]) ).
tff(c_8850,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_150,c_148,c_8843]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU023+1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/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 : n008.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 11:31:18 EDT 2023
% 0.14/0.36 % CPUTime :
% 9.05/3.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.05/3.43
% 9.05/3.43 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.05/3.46
% 9.05/3.46 Inference rules
% 9.05/3.46 ----------------------
% 9.05/3.46 #Ref : 0
% 9.05/3.46 #Sup : 1995
% 9.05/3.46 #Fact : 0
% 9.05/3.46 #Define : 0
% 9.05/3.46 #Split : 10
% 9.05/3.46 #Chain : 0
% 9.05/3.46 #Close : 0
% 9.05/3.46
% 9.05/3.46 Ordering : KBO
% 9.05/3.46
% 9.05/3.46 Simplification rules
% 9.05/3.46 ----------------------
% 9.05/3.46 #Subsume : 352
% 9.05/3.46 #Demod : 2268
% 9.05/3.46 #Tautology : 1237
% 9.05/3.46 #SimpNegUnit : 21
% 9.05/3.46 #BackRed : 24
% 9.05/3.46
% 9.05/3.46 #Partial instantiations: 0
% 9.05/3.46 #Strategies tried : 1
% 9.05/3.46
% 9.05/3.46 Timing (in seconds)
% 9.05/3.46 ----------------------
% 9.05/3.46 Preprocessing : 0.65
% 9.05/3.46 Parsing : 0.33
% 9.05/3.46 CNF conversion : 0.05
% 9.05/3.47 Main loop : 1.55
% 9.05/3.47 Inferencing : 0.52
% 9.05/3.47 Reduction : 0.51
% 9.05/3.47 Demodulation : 0.37
% 9.05/3.47 BG Simplification : 0.06
% 9.05/3.47 Subsumption : 0.36
% 9.05/3.47 Abstraction : 0.06
% 9.05/3.47 MUC search : 0.00
% 9.05/3.47 Cooper : 0.00
% 9.05/3.47 Total : 2.25
% 9.05/3.47 Index Insertion : 0.00
% 9.05/3.47 Index Deletion : 0.00
% 9.05/3.47 Index Matching : 0.00
% 9.05/3.47 BG Taut test : 0.00
%------------------------------------------------------------------------------