TSTP Solution File: SEU020+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU020+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 : n032.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 7.29s 2.79s
% Output : CNFRefutation 7.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 30
% Syntax : Number of formulae : 46 ( 13 unt; 25 typ; 0 def)
% Number of atoms : 60 ( 10 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 63 ( 24 ~; 22 |; 9 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 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 : 17 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 16 (; 15 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > one_to_one > function > empty > relation_composition > #nlpp > relation_rng > relation_dom > powerset > identity_relation > empty_set > #skF_7 > #skF_4 > #skF_11 > #skF_1 > #skF_10 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_9 > #skF_8
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
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(function,type,
function: $i > $o ).
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('#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('#skF_8',type,
'#skF_8': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff(f_224,negated_conjecture,
~ ! [A] :
( ( relation(A)
& function(A) )
=> ( ? [B] :
( relation(B)
& function(B)
& ( relation_composition(A,B) = identity_relation(relation_dom(A)) ) )
=> one_to_one(A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t53_funct_1) ).
tff(f_239,axiom,
! [A] :
( ( relation_dom(identity_relation(A)) = A )
& ( relation_rng(identity_relation(A)) = A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t71_relat_1) ).
tff(f_210,axiom,
! [A] : one_to_one(identity_relation(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t52_funct_1) ).
tff(f_177,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ! [B] :
( ( relation(B)
& function(B) )
=> ( ( relation_dom(relation_composition(B,A)) = relation_dom(B) )
=> subset(relation_rng(B),relation_dom(A)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_funct_1) ).
tff(f_202,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ! [B] :
( ( relation(B)
& function(B) )
=> ( ( one_to_one(relation_composition(B,A))
& subset(relation_rng(B),relation_dom(A)) )
=> one_to_one(B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t47_funct_1) ).
tff(c_102,plain,
~ one_to_one('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_108,plain,
relation('#skF_11'),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_106,plain,
function('#skF_11'),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_112,plain,
relation('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_110,plain,
function('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_104,plain,
identity_relation(relation_dom('#skF_10')) = relation_composition('#skF_10','#skF_11'),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_196,plain,
! [A_63] : ( relation_dom(identity_relation(A_63)) = A_63 ),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_205,plain,
relation_dom(relation_composition('#skF_10','#skF_11')) = relation_dom('#skF_10'),
inference(superposition,[status(thm),theory(equality)],[c_104,c_196]) ).
tff(c_139,plain,
! [A_58] : one_to_one(identity_relation(A_58)),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_141,plain,
one_to_one(relation_composition('#skF_10','#skF_11')),
inference(superposition,[status(thm),theory(equality)],[c_104,c_139]) ).
tff(c_2827,plain,
! [B_179,A_180] :
( subset(relation_rng(B_179),relation_dom(A_180))
| ( relation_dom(relation_composition(B_179,A_180)) != relation_dom(B_179) )
| ~ function(B_179)
| ~ relation(B_179)
| ~ function(A_180)
| ~ relation(A_180) ),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_96,plain,
! [B_39,A_37] :
( one_to_one(B_39)
| ~ subset(relation_rng(B_39),relation_dom(A_37))
| ~ one_to_one(relation_composition(B_39,A_37))
| ~ function(B_39)
| ~ relation(B_39)
| ~ function(A_37)
| ~ relation(A_37) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_5291,plain,
! [B_263,A_264] :
( one_to_one(B_263)
| ~ one_to_one(relation_composition(B_263,A_264))
| ( relation_dom(relation_composition(B_263,A_264)) != relation_dom(B_263) )
| ~ function(B_263)
| ~ relation(B_263)
| ~ function(A_264)
| ~ relation(A_264) ),
inference(resolution,[status(thm)],[c_2827,c_96]) ).
tff(c_5447,plain,
( one_to_one('#skF_10')
| ( relation_dom(relation_composition('#skF_10','#skF_11')) != relation_dom('#skF_10') )
| ~ function('#skF_10')
| ~ relation('#skF_10')
| ~ function('#skF_11')
| ~ relation('#skF_11') ),
inference(resolution,[status(thm)],[c_141,c_5291]) ).
tff(c_5556,plain,
one_to_one('#skF_10'),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_106,c_112,c_110,c_205,c_5447]) ).
tff(c_5558,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_102,c_5556]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU020+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.32 % Computer : n032.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Aug 3 12:12:51 EDT 2023
% 0.12/0.32 % CPUTime :
% 7.29/2.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.29/2.80
% 7.29/2.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.29/2.82
% 7.29/2.82 Inference rules
% 7.29/2.82 ----------------------
% 7.29/2.82 #Ref : 0
% 7.29/2.82 #Sup : 1260
% 7.29/2.82 #Fact : 0
% 7.29/2.82 #Define : 0
% 7.29/2.82 #Split : 3
% 7.29/2.82 #Chain : 0
% 7.29/2.82 #Close : 0
% 7.29/2.82
% 7.29/2.82 Ordering : KBO
% 7.29/2.82
% 7.29/2.82 Simplification rules
% 7.29/2.82 ----------------------
% 7.29/2.82 #Subsume : 275
% 7.29/2.82 #Demod : 1485
% 7.29/2.82 #Tautology : 656
% 7.29/2.82 #SimpNegUnit : 11
% 7.29/2.82 #BackRed : 8
% 7.29/2.82
% 7.29/2.82 #Partial instantiations: 0
% 7.29/2.82 #Strategies tried : 1
% 7.29/2.82
% 7.29/2.82 Timing (in seconds)
% 7.29/2.82 ----------------------
% 7.29/2.83 Preprocessing : 0.58
% 7.29/2.83 Parsing : 0.31
% 7.29/2.83 CNF conversion : 0.04
% 7.29/2.83 Main loop : 1.17
% 7.29/2.83 Inferencing : 0.40
% 7.29/2.83 Reduction : 0.39
% 7.29/2.83 Demodulation : 0.28
% 7.29/2.83 BG Simplification : 0.04
% 7.29/2.83 Subsumption : 0.27
% 7.29/2.83 Abstraction : 0.04
% 7.29/2.83 MUC search : 0.00
% 7.29/2.83 Cooper : 0.00
% 7.29/2.83 Total : 1.80
% 7.29/2.83 Index Insertion : 0.00
% 7.29/2.83 Index Deletion : 0.00
% 7.29/2.83 Index Matching : 0.00
% 7.29/2.83 BG Taut test : 0.00
%------------------------------------------------------------------------------