TSTP Solution File: SEU026+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU026+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 : n011.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 22.74s 10.59s
% Output : CNFRefutation 22.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 32
% Syntax : Number of formulae : 60 ( 13 unt; 26 typ; 0 def)
% Number of atoms : 98 ( 21 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 124 ( 60 ~; 47 |; 6 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 16 >; 4 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > one_to_one > function > empty > relation_composition > #nlpp > relation_rng > relation_dom > powerset > function_inverse > empty_set > #skF_4 > #skF_11 > #skF_1 > #skF_8 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #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(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_12',type,
'#skF_12': $i ).
tff(f_245,negated_conjecture,
~ ! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> ( ( relation_dom(relation_composition(function_inverse(A),A)) = relation_rng(A) )
& ( relation_rng(relation_composition(function_inverse(A),A)) = relation_rng(A) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t59_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_186,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_234,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_218,axiom,
! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> ( subset(relation_dom(A),relation_rng(B))
=> ( relation_rng(relation_composition(B,A)) = relation_rng(A) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t47_relat_1) ).
tff(f_209,axiom,
! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> ( subset(relation_rng(A),relation_dom(B))
=> ( relation_dom(relation_composition(A,B)) = relation_dom(A) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_relat_1) ).
tff(c_126,plain,
relation('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_124,plain,
function('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_245]) ).
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_122,plain,
one_to_one('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_100,plain,
! [A_26] : subset(A_26,A_26),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_116,plain,
! [A_43] :
( ( relation_rng(function_inverse(A_43)) = relation_dom(A_43) )
| ~ one_to_one(A_43)
| ~ function(A_43)
| ~ relation(A_43) ),
inference(cnfTransformation,[status(thm)],[f_234]) ).
tff(c_53024,plain,
! [B_820,A_821] :
( ( relation_rng(relation_composition(B_820,A_821)) = relation_rng(A_821) )
| ~ subset(relation_dom(A_821),relation_rng(B_820))
| ~ relation(B_820)
| ~ relation(A_821) ),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_79213,plain,
! [A_1026,A_1027] :
( ( relation_rng(relation_composition(function_inverse(A_1026),A_1027)) = relation_rng(A_1027) )
| ~ subset(relation_dom(A_1027),relation_dom(A_1026))
| ~ relation(function_inverse(A_1026))
| ~ relation(A_1027)
| ~ one_to_one(A_1026)
| ~ function(A_1026)
| ~ relation(A_1026) ),
inference(superposition,[status(thm),theory(equality)],[c_116,c_53024]) ).
tff(c_105962,plain,
! [A_1365] :
( ( relation_rng(relation_composition(function_inverse(A_1365),A_1365)) = relation_rng(A_1365) )
| ~ relation(function_inverse(A_1365))
| ~ one_to_one(A_1365)
| ~ function(A_1365)
| ~ relation(A_1365) ),
inference(resolution,[status(thm)],[c_100,c_79213]) ).
tff(c_118,plain,
! [A_43] :
( ( relation_dom(function_inverse(A_43)) = relation_rng(A_43) )
| ~ one_to_one(A_43)
| ~ function(A_43)
| ~ relation(A_43) ),
inference(cnfTransformation,[status(thm)],[f_234]) ).
tff(c_2311,plain,
! [A_169,B_170] :
( ( relation_dom(relation_composition(A_169,B_170)) = relation_dom(A_169) )
| ~ subset(relation_rng(A_169),relation_dom(B_170))
| ~ relation(B_170)
| ~ relation(A_169) ),
inference(cnfTransformation,[status(thm)],[f_209]) ).
tff(c_29480,plain,
! [A_403,B_404] :
( ( relation_dom(relation_composition(function_inverse(A_403),B_404)) = relation_dom(function_inverse(A_403)) )
| ~ subset(relation_dom(A_403),relation_dom(B_404))
| ~ relation(B_404)
| ~ relation(function_inverse(A_403))
| ~ one_to_one(A_403)
| ~ function(A_403)
| ~ relation(A_403) ),
inference(superposition,[status(thm),theory(equality)],[c_116,c_2311]) ).
tff(c_50560,plain,
! [A_708] :
( ( relation_dom(relation_composition(function_inverse(A_708),A_708)) = relation_dom(function_inverse(A_708)) )
| ~ relation(function_inverse(A_708))
| ~ one_to_one(A_708)
| ~ function(A_708)
| ~ relation(A_708) ),
inference(resolution,[status(thm)],[c_100,c_29480]) ).
tff(c_120,plain,
( ( relation_rng(relation_composition(function_inverse('#skF_12'),'#skF_12')) != relation_rng('#skF_12') )
| ( relation_dom(relation_composition(function_inverse('#skF_12'),'#skF_12')) != relation_rng('#skF_12') ) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_138,plain,
relation_dom(relation_composition(function_inverse('#skF_12'),'#skF_12')) != relation_rng('#skF_12'),
inference(splitLeft,[status(thm)],[c_120]) ).
tff(c_50759,plain,
( ( relation_dom(function_inverse('#skF_12')) != relation_rng('#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_50560,c_138]) ).
tff(c_50794,plain,
( ( relation_dom(function_inverse('#skF_12')) != relation_rng('#skF_12') )
| ~ relation(function_inverse('#skF_12')) ),
inference(demodulation,[status(thm),theory(equality)],[c_126,c_124,c_122,c_50759]) ).
tff(c_50804,plain,
~ relation(function_inverse('#skF_12')),
inference(splitLeft,[status(thm)],[c_50794]) ).
tff(c_50807,plain,
( ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(resolution,[status(thm)],[c_16,c_50804]) ).
tff(c_50814,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_126,c_124,c_50807]) ).
tff(c_50815,plain,
relation_dom(function_inverse('#skF_12')) != relation_rng('#skF_12'),
inference(splitRight,[status(thm)],[c_50794]) ).
tff(c_50931,plain,
( ~ one_to_one('#skF_12')
| ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(superposition,[status(thm),theory(equality)],[c_118,c_50815]) ).
tff(c_50935,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_126,c_124,c_122,c_50931]) ).
tff(c_50936,plain,
relation_rng(relation_composition(function_inverse('#skF_12'),'#skF_12')) != relation_rng('#skF_12'),
inference(splitRight,[status(thm)],[c_120]) ).
tff(c_106180,plain,
( ~ relation(function_inverse('#skF_12'))
| ~ one_to_one('#skF_12')
| ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(superposition,[status(thm),theory(equality)],[c_105962,c_50936]) ).
tff(c_106239,plain,
~ relation(function_inverse('#skF_12')),
inference(demodulation,[status(thm),theory(equality)],[c_126,c_124,c_122,c_106180]) ).
tff(c_106259,plain,
( ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(resolution,[status(thm)],[c_16,c_106239]) ).
tff(c_106266,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_126,c_124,c_106259]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU026+1 : TPTP v8.1.2. Released v3.2.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.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 12:08:50 EDT 2023
% 0.15/0.37 % CPUTime :
% 22.74/10.59 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.74/10.60
% 22.74/10.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 22.99/10.63
% 22.99/10.63 Inference rules
% 22.99/10.63 ----------------------
% 22.99/10.63 #Ref : 0
% 22.99/10.63 #Sup : 26157
% 22.99/10.63 #Fact : 0
% 22.99/10.63 #Define : 0
% 22.99/10.63 #Split : 36
% 22.99/10.63 #Chain : 0
% 22.99/10.63 #Close : 0
% 22.99/10.63
% 22.99/10.63 Ordering : KBO
% 22.99/10.63
% 22.99/10.63 Simplification rules
% 22.99/10.63 ----------------------
% 22.99/10.63 #Subsume : 5848
% 22.99/10.63 #Demod : 25112
% 22.99/10.63 #Tautology : 12294
% 22.99/10.63 #SimpNegUnit : 37
% 22.99/10.63 #BackRed : 27
% 22.99/10.63
% 22.99/10.63 #Partial instantiations: 0
% 22.99/10.63 #Strategies tried : 1
% 22.99/10.63
% 22.99/10.63 Timing (in seconds)
% 22.99/10.63 ----------------------
% 22.99/10.63 Preprocessing : 0.58
% 22.99/10.63 Parsing : 0.31
% 22.99/10.63 CNF conversion : 0.05
% 22.99/10.63 Main loop : 8.97
% 22.99/10.63 Inferencing : 1.74
% 22.99/10.63 Reduction : 2.97
% 22.99/10.63 Demodulation : 2.25
% 22.99/10.63 BG Simplification : 0.14
% 22.99/10.63 Subsumption : 3.64
% 22.99/10.63 Abstraction : 0.18
% 22.99/10.63 MUC search : 0.00
% 22.99/10.63 Cooper : 0.00
% 22.99/10.63 Total : 9.59
% 22.99/10.63 Index Insertion : 0.00
% 22.99/10.63 Index Deletion : 0.00
% 22.99/10.63 Index Matching : 0.00
% 22.99/10.63 BG Taut test : 0.00
%------------------------------------------------------------------------------