TSTP Solution File: SEU037+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU037+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n013.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 7.40s 2.65s
% Output : CNFRefutation 7.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 34
% Syntax : Number of formulae : 58 ( 13 unt; 29 typ; 0 def)
% Number of atoms : 72 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 79 ( 36 ~; 29 |; 6 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 17 >; 8 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 12 con; 0-3 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > one_to_one > function > empty > set_intersection2 > relation_dom_restriction > apply > #nlpp > relation_dom > powerset > empty_set > #skF_4 > #skF_11 > #skF_15 > #skF_1 > #skF_12 > #skF_8 > #skF_7 > #skF_10 > #skF_14 > #skF_5 > #skF_6 > #skF_13 > #skF_2 > #skF_3 > #skF_9
%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(apply,type,
apply: ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': $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_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
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_14',type,
'#skF_14': $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(relation_dom_restriction,type,
relation_dom_restriction: ( $i * $i ) > $i ).
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(f_220,negated_conjecture,
~ ! [A,B,C] :
( ( relation(C)
& function(C) )
=> ( in(B,set_intersection2(relation_dom(C),A))
=> ( apply(relation_dom_restriction(C,A),B) = apply(C,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t71_funct_1) ).
tff(f_91,axiom,
! [A,B] :
( ( relation(A)
& function(A) )
=> ( relation(relation_dom_restriction(A,B))
& function(relation_dom_restriction(A,B)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
tff(f_57,axiom,
! [A,B] :
( relation(A)
=> relation(relation_dom_restriction(A,B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
tff(f_207,axiom,
! [A,B] :
( ( relation(B)
& function(B) )
=> ! [C] :
( ( relation(C)
& function(C) )
=> ( ( B = relation_dom_restriction(C,A) )
<=> ( ( relation_dom(B) = set_intersection2(relation_dom(C),A) )
& ! [D] :
( in(D,relation_dom(B))
=> ( apply(B,D) = apply(C,D) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
tff(f_53,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(c_124,plain,
relation('#skF_15'),
inference(cnfTransformation,[status(thm)],[f_220]) ).
tff(c_122,plain,
function('#skF_15'),
inference(cnfTransformation,[status(thm)],[f_220]) ).
tff(c_36,plain,
! [A_17,B_18] :
( function(relation_dom_restriction(A_17,B_18))
| ~ function(A_17)
| ~ relation(A_17) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_16,plain,
! [A_8,B_9] :
( relation(relation_dom_restriction(A_8,B_9))
| ~ relation(A_8) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_118,plain,
apply(relation_dom_restriction('#skF_15','#skF_13'),'#skF_14') != apply('#skF_15','#skF_14'),
inference(cnfTransformation,[status(thm)],[f_220]) ).
tff(c_647,plain,
! [C_129,A_130] :
( ( set_intersection2(relation_dom(C_129),A_130) = relation_dom(relation_dom_restriction(C_129,A_130)) )
| ~ function(C_129)
| ~ relation(C_129)
| ~ function(relation_dom_restriction(C_129,A_130))
| ~ relation(relation_dom_restriction(C_129,A_130)) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_1637,plain,
! [A_190,B_191] :
( ( set_intersection2(relation_dom(A_190),B_191) = relation_dom(relation_dom_restriction(A_190,B_191)) )
| ~ function(A_190)
| ~ function(relation_dom_restriction(A_190,B_191))
| ~ relation(A_190) ),
inference(resolution,[status(thm)],[c_16,c_647]) ).
tff(c_4779,plain,
! [A_260,B_261] :
( ( set_intersection2(relation_dom(A_260),B_261) = relation_dom(relation_dom_restriction(A_260,B_261)) )
| ~ function(A_260)
| ~ relation(A_260) ),
inference(resolution,[status(thm)],[c_36,c_1637]) ).
tff(c_14,plain,
! [B_7,A_6] : ( set_intersection2(B_7,A_6) = set_intersection2(A_6,B_7) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_5265,plain,
! [B_271,A_272] :
( ( set_intersection2(B_271,relation_dom(A_272)) = relation_dom(relation_dom_restriction(A_272,B_271)) )
| ~ function(A_272)
| ~ relation(A_272) ),
inference(superposition,[status(thm),theory(equality)],[c_4779,c_14]) ).
tff(c_120,plain,
in('#skF_14',set_intersection2(relation_dom('#skF_15'),'#skF_13')),
inference(cnfTransformation,[status(thm)],[f_220]) ).
tff(c_132,plain,
in('#skF_14',set_intersection2('#skF_13',relation_dom('#skF_15'))),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_120]) ).
tff(c_5314,plain,
( in('#skF_14',relation_dom(relation_dom_restriction('#skF_15','#skF_13')))
| ~ function('#skF_15')
| ~ relation('#skF_15') ),
inference(superposition,[status(thm),theory(equality)],[c_5265,c_132]) ).
tff(c_5403,plain,
in('#skF_14',relation_dom(relation_dom_restriction('#skF_15','#skF_13'))),
inference(demodulation,[status(thm),theory(equality)],[c_124,c_122,c_5314]) ).
tff(c_112,plain,
! [C_49,A_42,D_52] :
( ( apply(relation_dom_restriction(C_49,A_42),D_52) = apply(C_49,D_52) )
| ~ in(D_52,relation_dom(relation_dom_restriction(C_49,A_42)))
| ~ function(C_49)
| ~ relation(C_49)
| ~ function(relation_dom_restriction(C_49,A_42))
| ~ relation(relation_dom_restriction(C_49,A_42)) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_5447,plain,
( ( apply(relation_dom_restriction('#skF_15','#skF_13'),'#skF_14') = apply('#skF_15','#skF_14') )
| ~ function('#skF_15')
| ~ relation('#skF_15')
| ~ function(relation_dom_restriction('#skF_15','#skF_13'))
| ~ relation(relation_dom_restriction('#skF_15','#skF_13')) ),
inference(resolution,[status(thm)],[c_5403,c_112]) ).
tff(c_5465,plain,
( ( apply(relation_dom_restriction('#skF_15','#skF_13'),'#skF_14') = apply('#skF_15','#skF_14') )
| ~ function(relation_dom_restriction('#skF_15','#skF_13'))
| ~ relation(relation_dom_restriction('#skF_15','#skF_13')) ),
inference(demodulation,[status(thm),theory(equality)],[c_124,c_122,c_5447]) ).
tff(c_5466,plain,
( ~ function(relation_dom_restriction('#skF_15','#skF_13'))
| ~ relation(relation_dom_restriction('#skF_15','#skF_13')) ),
inference(negUnitSimplification,[status(thm)],[c_118,c_5465]) ).
tff(c_5473,plain,
~ relation(relation_dom_restriction('#skF_15','#skF_13')),
inference(splitLeft,[status(thm)],[c_5466]) ).
tff(c_5476,plain,
~ relation('#skF_15'),
inference(resolution,[status(thm)],[c_16,c_5473]) ).
tff(c_5483,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_124,c_5476]) ).
tff(c_5484,plain,
~ function(relation_dom_restriction('#skF_15','#skF_13')),
inference(splitRight,[status(thm)],[c_5466]) ).
tff(c_5488,plain,
( ~ function('#skF_15')
| ~ relation('#skF_15') ),
inference(resolution,[status(thm)],[c_36,c_5484]) ).
tff(c_5495,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_124,c_122,c_5488]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU037+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 11:28:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 7.40/2.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.40/2.65
% 7.40/2.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.40/2.68
% 7.40/2.68 Inference rules
% 7.40/2.68 ----------------------
% 7.40/2.68 #Ref : 1
% 7.40/2.68 #Sup : 1510
% 7.40/2.68 #Fact : 0
% 7.40/2.68 #Define : 0
% 7.40/2.68 #Split : 16
% 7.40/2.68 #Chain : 0
% 7.40/2.68 #Close : 0
% 7.40/2.68
% 7.40/2.68 Ordering : KBO
% 7.40/2.68
% 7.40/2.68 Simplification rules
% 7.40/2.68 ----------------------
% 7.40/2.68 #Subsume : 559
% 7.40/2.68 #Demod : 651
% 7.40/2.68 #Tautology : 297
% 7.40/2.68 #SimpNegUnit : 26
% 7.40/2.68 #BackRed : 12
% 7.40/2.68
% 7.40/2.68 #Partial instantiations: 0
% 7.40/2.68 #Strategies tried : 1
% 7.40/2.68
% 7.40/2.68 Timing (in seconds)
% 7.40/2.68 ----------------------
% 7.40/2.68 Preprocessing : 0.56
% 7.40/2.68 Parsing : 0.28
% 7.40/2.68 CNF conversion : 0.04
% 7.40/2.68 Main loop : 1.08
% 7.40/2.68 Inferencing : 0.34
% 7.40/2.68 Reduction : 0.35
% 7.40/2.68 Demodulation : 0.25
% 7.40/2.68 BG Simplification : 0.05
% 7.40/2.68 Subsumption : 0.27
% 7.40/2.68 Abstraction : 0.05
% 7.40/2.68 MUC search : 0.00
% 7.40/2.68 Cooper : 0.00
% 7.40/2.68 Total : 1.69
% 7.40/2.68 Index Insertion : 0.00
% 7.40/2.68 Index Deletion : 0.00
% 7.40/2.68 Index Matching : 0.00
% 7.40/2.68 BG Taut test : 0.00
%------------------------------------------------------------------------------