TSTP Solution File: SEU376+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU376+1 : TPTP v8.1.2. Released v3.3.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 : n028.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:58:34 EDT 2023
% Result : Theorem 115.80s 98.89s
% Output : CNFRefutation 115.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 62
% Syntax : Number of formulae : 88 ( 9 unt; 57 typ; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 11 ( 5 avg)
% Number of connectives : 223 ( 88 ~; 103 |; 14 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 80 ( 42 >; 38 *; 0 +; 0 <<)
% Number of predicates : 22 ( 21 usr; 1 prp; 0-3 aty)
% Number of functors : 36 ( 36 usr; 15 con; 0-4 aty)
% Number of variables : 64 (; 61 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ relation_of2_as_subset > relation_of2 > related > quasi_total > is_often_in > is_eventually_in > subset > net_str > in > element > v1_yellow_3 > transitive_relstr > relation_empty_yielding > relation > rel_str > one_to_one > one_sorted_str > function > empty_carrier > empty > directed_relstr > apply_on_structs > apply_netmap > the_mapping > cartesian_product2 > apply > #nlpp > the_carrier > powerset > empty_set > #skF_25 > #skF_7 > #skF_11 > #skF_18 > #skF_15 > #skF_19 > #skF_13 > #skF_16 > #skF_26 > #skF_14 > #skF_10 > #skF_5 > #skF_2 > #skF_21 > #skF_9 > #skF_4 > #skF_8 > #skF_17 > #skF_22 > #skF_3 > #skF_28 > #skF_24 > #skF_27 > #skF_23 > #skF_12 > #skF_1 > #skF_6 > #skF_20
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_25',type,
'#skF_25': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(empty_carrier,type,
empty_carrier: $i > $o ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(directed_relstr,type,
directed_relstr: $i > $o ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_18',type,
'#skF_18': $i ).
tff(related,type,
related: ( $i * $i * $i ) > $o ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(quasi_total,type,
quasi_total: ( $i * $i * $i ) > $o ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(the_carrier,type,
the_carrier: $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('#skF_19',type,
'#skF_19': $i ).
tff(is_often_in,type,
is_often_in: ( $i * $i * $i ) > $o ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff(is_eventually_in,type,
is_eventually_in: ( $i * $i * $i ) > $o ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(net_str,type,
net_str: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(apply_netmap,type,
apply_netmap: ( $i * $i * $i ) > $i ).
tff(one_sorted_str,type,
one_sorted_str: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(v1_yellow_3,type,
v1_yellow_3: $i > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(transitive_relstr,type,
transitive_relstr: $i > $o ).
tff(apply_on_structs,type,
apply_on_structs: ( $i * $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_21',type,
'#skF_21': $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_of2,type,
relation_of2: ( $i * $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff(the_mapping,type,
the_mapping: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(rel_str,type,
rel_str: $i > $o ).
tff('#skF_28',type,
'#skF_28': $i ).
tff('#skF_24',type,
'#skF_24': $i ).
tff('#skF_27',type,
'#skF_27': $i ).
tff('#skF_23',type,
'#skF_23': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i * $i ) > $i ).
tff(relation_of2_as_subset,type,
relation_of2_as_subset: ( $i * $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(f_400,negated_conjecture,
~ ! [A] :
( ( ~ empty_carrier(A)
& one_sorted_str(A) )
=> ! [B] :
( ( ~ empty_carrier(B)
& transitive_relstr(B)
& directed_relstr(B)
& net_str(B,A) )
=> ! [C] :
( is_eventually_in(A,B,C)
=> is_often_in(A,B,C) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_yellow_6) ).
tff(f_199,axiom,
! [A] :
( one_sorted_str(A)
=> ! [B] :
( net_str(B,A)
=> rel_str(B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_waybel_0) ).
tff(f_117,axiom,
! [A] :
( ( ~ empty_carrier(A)
& one_sorted_str(A) )
=> ! [B] :
( ( ~ empty_carrier(B)
& net_str(B,A) )
=> ! [C] :
( is_often_in(A,B,C)
<=> ! [D] :
( element(D,the_carrier(B))
=> ? [E] :
( element(E,the_carrier(B))
& related(B,D,E)
& in(apply_netmap(A,B,E),C) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d12_waybel_0) ).
tff(f_93,axiom,
! [A] :
( ( ~ empty_carrier(A)
& one_sorted_str(A) )
=> ! [B] :
( ( ~ empty_carrier(B)
& net_str(B,A) )
=> ! [C] :
( is_eventually_in(A,B,C)
<=> ? [D] :
( element(D,the_carrier(B))
& ! [E] :
( element(E,the_carrier(B))
=> ( related(B,D,E)
=> in(apply_netmap(A,B,E),C) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_waybel_0) ).
tff(f_137,axiom,
! [A] :
( ( ~ empty_carrier(A)
& rel_str(A) )
=> ( directed_relstr(A)
<=> ! [B] :
( element(B,the_carrier(A))
=> ! [C] :
( element(C,the_carrier(A))
=> ? [D] :
( element(D,the_carrier(A))
& related(A,B,D)
& related(A,C,D) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_yellow_6) ).
tff(c_202,plain,
~ empty_carrier('#skF_26'),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_198,plain,
~ empty_carrier('#skF_27'),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_200,plain,
one_sorted_str('#skF_26'),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_192,plain,
net_str('#skF_27','#skF_26'),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_190,plain,
is_eventually_in('#skF_26','#skF_27','#skF_28'),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_303,plain,
! [B_248,A_249] :
( rel_str(B_248)
| ~ net_str(B_248,A_249)
| ~ one_sorted_str(A_249) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_309,plain,
( rel_str('#skF_27')
| ~ one_sorted_str('#skF_26') ),
inference(resolution,[status(thm)],[c_192,c_303]) ).
tff(c_313,plain,
rel_str('#skF_27'),
inference(demodulation,[status(thm),theory(equality)],[c_200,c_309]) ).
tff(c_194,plain,
directed_relstr('#skF_27'),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_38,plain,
! [A_64,B_92,C_106] :
( element('#skF_3'(A_64,B_92,C_106),the_carrier(B_92))
| is_often_in(A_64,B_92,C_106)
| ~ net_str(B_92,A_64)
| empty_carrier(B_92)
| ~ one_sorted_str(A_64)
| empty_carrier(A_64) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_22,plain,
! [A_11,B_39,C_53] :
( element('#skF_2'(A_11,B_39,C_53),the_carrier(B_39))
| ~ is_eventually_in(A_11,B_39,C_53)
| ~ net_str(B_39,A_11)
| empty_carrier(B_39)
| ~ one_sorted_str(A_11)
| empty_carrier(A_11) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_50,plain,
! [A_117,B_132,C_136] :
( element('#skF_5'(A_117,B_132,C_136),the_carrier(A_117))
| ~ element(C_136,the_carrier(A_117))
| ~ element(B_132,the_carrier(A_117))
| ~ directed_relstr(A_117)
| ~ rel_str(A_117)
| empty_carrier(A_117) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_48,plain,
! [A_117,B_132,C_136] :
( related(A_117,B_132,'#skF_5'(A_117,B_132,C_136))
| ~ element(C_136,the_carrier(A_117))
| ~ element(B_132,the_carrier(A_117))
| ~ directed_relstr(A_117)
| ~ rel_str(A_117)
| empty_carrier(A_117) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_1651,plain,
! [A_532,B_533,E_534,C_535] :
( in(apply_netmap(A_532,B_533,E_534),C_535)
| ~ related(B_533,'#skF_2'(A_532,B_533,C_535),E_534)
| ~ element(E_534,the_carrier(B_533))
| ~ is_eventually_in(A_532,B_533,C_535)
| ~ net_str(B_533,A_532)
| empty_carrier(B_533)
| ~ one_sorted_str(A_532)
| empty_carrier(A_532) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_1670,plain,
! [A_532,A_117,C_535,C_136] :
( in(apply_netmap(A_532,A_117,'#skF_5'(A_117,'#skF_2'(A_532,A_117,C_535),C_136)),C_535)
| ~ element('#skF_5'(A_117,'#skF_2'(A_532,A_117,C_535),C_136),the_carrier(A_117))
| ~ is_eventually_in(A_532,A_117,C_535)
| ~ net_str(A_117,A_532)
| ~ one_sorted_str(A_532)
| empty_carrier(A_532)
| ~ element(C_136,the_carrier(A_117))
| ~ element('#skF_2'(A_532,A_117,C_535),the_carrier(A_117))
| ~ directed_relstr(A_117)
| ~ rel_str(A_117)
| empty_carrier(A_117) ),
inference(resolution,[status(thm)],[c_48,c_1651]) ).
tff(c_46,plain,
! [A_117,C_136,B_132] :
( related(A_117,C_136,'#skF_5'(A_117,B_132,C_136))
| ~ element(C_136,the_carrier(A_117))
| ~ element(B_132,the_carrier(A_117))
| ~ directed_relstr(A_117)
| ~ rel_str(A_117)
| empty_carrier(A_117) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_1616,plain,
! [A_520,B_521,E_522,C_523] :
( ~ in(apply_netmap(A_520,B_521,E_522),C_523)
| ~ related(B_521,'#skF_3'(A_520,B_521,C_523),E_522)
| ~ element(E_522,the_carrier(B_521))
| is_often_in(A_520,B_521,C_523)
| ~ net_str(B_521,A_520)
| empty_carrier(B_521)
| ~ one_sorted_str(A_520)
| empty_carrier(A_520) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_20173,plain,
! [A_954,A_955,B_956,C_957] :
( ~ in(apply_netmap(A_954,A_955,'#skF_5'(A_955,B_956,'#skF_3'(A_954,A_955,C_957))),C_957)
| ~ element('#skF_5'(A_955,B_956,'#skF_3'(A_954,A_955,C_957)),the_carrier(A_955))
| is_often_in(A_954,A_955,C_957)
| ~ net_str(A_955,A_954)
| ~ one_sorted_str(A_954)
| empty_carrier(A_954)
| ~ element('#skF_3'(A_954,A_955,C_957),the_carrier(A_955))
| ~ element(B_956,the_carrier(A_955))
| ~ directed_relstr(A_955)
| ~ rel_str(A_955)
| empty_carrier(A_955) ),
inference(resolution,[status(thm)],[c_46,c_1616]) ).
tff(c_100761,plain,
! [A_1630,A_1631,C_1632] :
( is_often_in(A_1630,A_1631,C_1632)
| ~ element('#skF_5'(A_1631,'#skF_2'(A_1630,A_1631,C_1632),'#skF_3'(A_1630,A_1631,C_1632)),the_carrier(A_1631))
| ~ is_eventually_in(A_1630,A_1631,C_1632)
| ~ net_str(A_1631,A_1630)
| ~ one_sorted_str(A_1630)
| empty_carrier(A_1630)
| ~ element('#skF_3'(A_1630,A_1631,C_1632),the_carrier(A_1631))
| ~ element('#skF_2'(A_1630,A_1631,C_1632),the_carrier(A_1631))
| ~ directed_relstr(A_1631)
| ~ rel_str(A_1631)
| empty_carrier(A_1631) ),
inference(resolution,[status(thm)],[c_1670,c_20173]) ).
tff(c_375116,plain,
! [A_2966,A_2967,C_2968] :
( is_often_in(A_2966,A_2967,C_2968)
| ~ is_eventually_in(A_2966,A_2967,C_2968)
| ~ net_str(A_2967,A_2966)
| ~ one_sorted_str(A_2966)
| empty_carrier(A_2966)
| ~ element('#skF_3'(A_2966,A_2967,C_2968),the_carrier(A_2967))
| ~ element('#skF_2'(A_2966,A_2967,C_2968),the_carrier(A_2967))
| ~ directed_relstr(A_2967)
| ~ rel_str(A_2967)
| empty_carrier(A_2967) ),
inference(resolution,[status(thm)],[c_50,c_100761]) ).
tff(c_389154,plain,
! [A_3046,B_3047,C_3048] :
( is_often_in(A_3046,B_3047,C_3048)
| ~ element('#skF_3'(A_3046,B_3047,C_3048),the_carrier(B_3047))
| ~ directed_relstr(B_3047)
| ~ rel_str(B_3047)
| ~ is_eventually_in(A_3046,B_3047,C_3048)
| ~ net_str(B_3047,A_3046)
| empty_carrier(B_3047)
| ~ one_sorted_str(A_3046)
| empty_carrier(A_3046) ),
inference(resolution,[status(thm)],[c_22,c_375116]) ).
tff(c_389164,plain,
! [B_3049,A_3050,C_3051] :
( ~ directed_relstr(B_3049)
| ~ rel_str(B_3049)
| ~ is_eventually_in(A_3050,B_3049,C_3051)
| is_often_in(A_3050,B_3049,C_3051)
| ~ net_str(B_3049,A_3050)
| empty_carrier(B_3049)
| ~ one_sorted_str(A_3050)
| empty_carrier(A_3050) ),
inference(resolution,[status(thm)],[c_38,c_389154]) ).
tff(c_188,plain,
~ is_often_in('#skF_26','#skF_27','#skF_28'),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_389192,plain,
( ~ directed_relstr('#skF_27')
| ~ rel_str('#skF_27')
| ~ is_eventually_in('#skF_26','#skF_27','#skF_28')
| ~ net_str('#skF_27','#skF_26')
| empty_carrier('#skF_27')
| ~ one_sorted_str('#skF_26')
| empty_carrier('#skF_26') ),
inference(resolution,[status(thm)],[c_389164,c_188]) ).
tff(c_389202,plain,
( empty_carrier('#skF_27')
| empty_carrier('#skF_26') ),
inference(demodulation,[status(thm),theory(equality)],[c_200,c_192,c_190,c_313,c_194,c_389192]) ).
tff(c_389204,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_202,c_198,c_389202]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU376+1 : TPTP v8.1.2. Released v3.3.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.16/0.36 % Computer : n028.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 12:24:39 EDT 2023
% 0.16/0.36 % CPUTime :
% 115.80/98.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 115.80/98.90
% 115.80/98.90 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 115.95/98.93
% 115.95/98.93 Inference rules
% 115.95/98.93 ----------------------
% 115.95/98.93 #Ref : 1
% 115.95/98.93 #Sup : 123924
% 115.95/98.93 #Fact : 17
% 115.95/98.93 #Define : 0
% 115.95/98.93 #Split : 89
% 115.95/98.93 #Chain : 0
% 115.95/98.93 #Close : 0
% 115.95/98.93
% 115.95/98.93 Ordering : KBO
% 115.95/98.93
% 115.95/98.93 Simplification rules
% 115.95/98.93 ----------------------
% 115.95/98.93 #Subsume : 113998
% 115.95/98.93 #Demod : 1400
% 115.95/98.93 #Tautology : 2582
% 115.95/98.93 #SimpNegUnit : 13571
% 115.95/98.93 #BackRed : 5393
% 115.95/98.93
% 115.95/98.93 #Partial instantiations: 0
% 115.95/98.93 #Strategies tried : 1
% 115.95/98.93
% 115.95/98.93 Timing (in seconds)
% 115.95/98.93 ----------------------
% 115.95/98.93 Preprocessing : 0.67
% 115.95/98.93 Parsing : 0.35
% 115.95/98.93 CNF conversion : 0.06
% 115.95/98.93 Main loop : 97.06
% 115.95/98.93 Inferencing : 9.38
% 115.95/98.93 Reduction : 20.54
% 115.95/98.93 Demodulation : 15.11
% 115.95/98.93 BG Simplification : 0.33
% 115.95/98.93 Subsumption : 64.61
% 115.95/98.93 Abstraction : 1.26
% 115.95/98.93 MUC search : 0.00
% 115.95/98.93 Cooper : 0.00
% 115.95/98.93 Total : 97.78
% 115.95/98.93 Index Insertion : 0.00
% 115.95/98.93 Index Deletion : 0.00
% 115.95/98.93 Index Matching : 0.00
% 115.95/98.93 BG Taut test : 0.00
%------------------------------------------------------------------------------