TSTP Solution File: SEU177+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU177+2 : 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 : n027.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:55 EDT 2023
% Result : Theorem 17.28s 5.93s
% Output : CNFRefutation 17.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 84
% Syntax : Number of formulae : 97 ( 8 unt; 81 typ; 0 def)
% Number of atoms : 32 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 27 ( 11 ~; 7 |; 1 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 155 ( 74 >; 81 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 73 ( 73 usr; 7 con; 0-4 aty)
% Number of variables : 17 (; 15 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > element > disjoint > are_equipotent > relation > empty > subset_difference > unordered_pair > union_of_subsets > subset_complement > set_union2 > set_intersection2 > set_difference > ordered_pair > meet_of_subsets > complements_of_subsets > cartesian_product2 > #nlpp > union > singleton > set_meet > relation_rng > relation_dom > powerset > cast_to_subset > empty_set > #skF_53 > #skF_13 > #skF_32 > #skF_26 > #skF_7 > #skF_35 > #skF_6 > #skF_17 > #skF_31 > #skF_1 > #skF_20 > #skF_22 > #skF_12 > #skF_18 > #skF_19 > #skF_40 > #skF_48 > #skF_36 > #skF_3 > #skF_34 > #skF_47 > #skF_30 > #skF_46 > #skF_41 > #skF_33 > #skF_49 > #skF_38 > #skF_43 > #skF_54 > #skF_37 > #skF_8 > #skF_51 > #skF_11 > #skF_28 > #skF_24 > #skF_15 > #skF_23 > #skF_14 > #skF_42 > #skF_50 > #skF_52 > #skF_25 > #skF_2 > #skF_44 > #skF_29 > #skF_27 > #skF_21 > #skF_45 > #skF_9 > #skF_5 > #skF_4 > #skF_16 > #skF_10 > #skF_39
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_53',type,
'#skF_53': $i > $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff(are_equipotent,type,
are_equipotent: ( $i * $i ) > $o ).
tff(subset_difference,type,
subset_difference: ( $i * $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': ( $i * $i * $i ) > $i ).
tff('#skF_26',type,
'#skF_26': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(complements_of_subsets,type,
complements_of_subsets: ( $i * $i ) > $i ).
tff('#skF_35',type,
'#skF_35': ( $i * $i ) > $i ).
tff(relation,type,
relation: $i > $o ).
tff(cast_to_subset,type,
cast_to_subset: $i > $i ).
tff(union,type,
union: $i > $i ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff('#skF_31',type,
'#skF_31': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff(meet_of_subsets,type,
meet_of_subsets: ( $i * $i ) > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i * $i ) > $i ).
tff('#skF_40',type,
'#skF_40': $i ).
tff('#skF_48',type,
'#skF_48': $i ).
tff('#skF_36',type,
'#skF_36': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': ( $i * $i ) > $i ).
tff('#skF_47',type,
'#skF_47': $i ).
tff(proper_subset,type,
proper_subset: ( $i * $i ) > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_30',type,
'#skF_30': ( $i * $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': $i ).
tff('#skF_41',type,
'#skF_41': $i > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_33',type,
'#skF_33': ( $i * $i ) > $i ).
tff('#skF_49',type,
'#skF_49': ( $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_38',type,
'#skF_38': $i > $i ).
tff('#skF_43',type,
'#skF_43': $i > $i ).
tff('#skF_54',type,
'#skF_54': ( $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': ( $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_51',type,
'#skF_51': ( $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff('#skF_28',type,
'#skF_28': ( $i * $i ) > $i ).
tff(set_meet,type,
set_meet: $i > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff('#skF_42',type,
'#skF_42': $i ).
tff('#skF_50',type,
'#skF_50': ( $i * $i ) > $i ).
tff('#skF_52',type,
'#skF_52': ( $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(union_of_subsets,type,
union_of_subsets: ( $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(subset_complement,type,
subset_complement: ( $i * $i ) > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_44',type,
'#skF_44': $i ).
tff('#skF_29',type,
'#skF_29': ( $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i ) > $i ).
tff('#skF_45',type,
'#skF_45': $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff('#skF_39',type,
'#skF_39': ( $i * $i ) > $i ).
tff(f_479,negated_conjecture,
~ ! [A,B,C] :
( relation(C)
=> ( in(ordered_pair(A,B),C)
=> ( in(A,relation_dom(C))
& in(B,relation_rng(C)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_relat_1) ).
tff(f_157,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_dom(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(C,D),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
tff(f_190,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_rng(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(D,C),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_relat_1) ).
tff(c_416,plain,
( ~ in('#skF_47',relation_rng('#skF_48'))
| ~ in('#skF_46',relation_dom('#skF_48')) ),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_599,plain,
~ in('#skF_46',relation_dom('#skF_48')),
inference(splitLeft,[status(thm)],[c_416]) ).
tff(c_420,plain,
relation('#skF_48'),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_418,plain,
in(ordered_pair('#skF_46','#skF_47'),'#skF_48'),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_14429,plain,
! [C_1156,A_1157,D_1158] :
( in(C_1156,relation_dom(A_1157))
| ~ in(ordered_pair(C_1156,D_1158),A_1157)
| ~ relation(A_1157) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_14482,plain,
( in('#skF_46',relation_dom('#skF_48'))
| ~ relation('#skF_48') ),
inference(resolution,[status(thm)],[c_418,c_14429]) ).
tff(c_14498,plain,
in('#skF_46',relation_dom('#skF_48')),
inference(demodulation,[status(thm),theory(equality)],[c_420,c_14482]) ).
tff(c_14500,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_599,c_14498]) ).
tff(c_14501,plain,
~ in('#skF_47',relation_rng('#skF_48')),
inference(splitRight,[status(thm)],[c_416]) ).
tff(c_29403,plain,
! [C_1810,A_1811,D_1812] :
( in(C_1810,relation_rng(A_1811))
| ~ in(ordered_pair(D_1812,C_1810),A_1811)
| ~ relation(A_1811) ),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_29460,plain,
( in('#skF_47',relation_rng('#skF_48'))
| ~ relation('#skF_48') ),
inference(resolution,[status(thm)],[c_418,c_29403]) ).
tff(c_29477,plain,
in('#skF_47',relation_rng('#skF_48')),
inference(demodulation,[status(thm),theory(equality)],[c_420,c_29460]) ).
tff(c_29479,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14501,c_29477]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU177+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % 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.34 % Computer : n027.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 3 12:35:53 EDT 2023
% 0.16/0.35 % CPUTime :
% 17.28/5.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.28/5.93
% 17.28/5.93 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 17.28/5.96
% 17.28/5.96 Inference rules
% 17.28/5.96 ----------------------
% 17.28/5.96 #Ref : 9
% 17.28/5.96 #Sup : 7223
% 17.28/5.96 #Fact : 0
% 17.28/5.96 #Define : 0
% 17.28/5.96 #Split : 9
% 17.28/5.96 #Chain : 0
% 17.28/5.96 #Close : 0
% 17.28/5.96
% 17.28/5.96 Ordering : KBO
% 17.28/5.96
% 17.28/5.96 Simplification rules
% 17.28/5.96 ----------------------
% 17.28/5.96 #Subsume : 2874
% 17.28/5.96 #Demod : 1497
% 17.28/5.96 #Tautology : 2048
% 17.28/5.96 #SimpNegUnit : 211
% 17.28/5.96 #BackRed : 47
% 17.28/5.96
% 17.28/5.96 #Partial instantiations: 0
% 17.28/5.96 #Strategies tried : 1
% 17.28/5.96
% 17.28/5.96 Timing (in seconds)
% 17.28/5.96 ----------------------
% 17.28/5.96 Preprocessing : 0.90
% 17.28/5.96 Parsing : 0.42
% 17.28/5.96 CNF conversion : 0.10
% 17.28/5.97 Main loop : 3.93
% 17.28/5.97 Inferencing : 0.93
% 17.28/5.97 Reduction : 1.65
% 17.28/5.97 Demodulation : 1.09
% 17.28/5.97 BG Simplification : 0.10
% 17.28/5.97 Subsumption : 0.92
% 17.28/5.97 Abstraction : 0.08
% 17.28/5.97 MUC search : 0.00
% 17.28/5.97 Cooper : 0.00
% 17.28/5.97 Total : 4.88
% 17.28/5.97 Index Insertion : 0.00
% 17.28/5.97 Index Deletion : 0.00
% 17.28/5.97 Index Matching : 0.00
% 17.28/5.97 BG Taut test : 0.00
%------------------------------------------------------------------------------